一种基于上下文协商的动态服务组合方法.pdfVIP

计算机研究 与发展 ISSN 1000—1239／CN 1l～1777门rP JournalofComputerResearchandDevelopment 45(11)：1902—1910，2008 一 种基于上下文协商的动态服务组合方法 唐 磊 淮晓永 李明树3 (中国科学院软件研究所互联网软件技术实验室 北京 100190) 。(中国科学院软件研究所 国家基础软件工程中心 北京 100190) 。(中国科学院软件研究所计算机科学重点实验室 北京 100190) (中国科学院研究生院 北京 100049) (tanglei@itechs．iseas．ae．cn) AnApproach toDynamicServiceCompositionBasedonContextNegotiation TangLei”，HuaiXiaoyong。，andLiM ingshu ’。 (LaboratoryforInternetSoft7A)areTechnologies，InstituteofSoftware，ChineseAcademyofSciences．Beijing100190) (NationalEngineeringResearchCenterforFundamentalSoftware，InstituteofSoftware，ChineseAcademyofSciences． Beijing100190) 。(KeyLaboratoryforComputerScience，InstituteofSoft~are，ChineseAcademyofSciences，Beijing100190) (GraduateUniversityofChineseAcademyofSciences，Beijing100049) Abstract CompositionofW eb serviceshasreceivedmoreandmoreinterestto supportbusiness～to～ businessorenterpriseapplicationintegration．Inthispaper，anapproachtoservicecompositionbased on contextnegotiation ispresented and applied to distributed documentmanagementsystem for pervasivecomputing．Itcannotonlyadapttothedynamicenvironmentforpervasivecomputing，but alsosatisfytheuser’Spreferences．First，thedefinitionsofthecontextandcontextawareserviceare given．Basedonthedefinitions，theconstraintconditionsofcontextnegotiationaregiven．According to the constraint conditions，the service composition algorithm is presented． Furthermore，the algorithm is optimized to improve the resource utilization． Finally， the prototype of service compositionisrealizedbasedoncontextnegotiationispresentedandapplied todistributeddocument managementsystem forpervasivecomputing．Someexperimentsaregiven tovalidatethealgorithm performanceandvalidity，i．e．，thetimecostwhen increasingthenumberofcandidateservicesand context，theconflictsofcandidateservicesselectionwhenincreasingthenumberofcontext，etc．The