Indeterminacy-aware service selection for reliable service composition
Indeterminacy-aware service selection for reliable service composition作者机构:Shanxi Univ Comp & Informat Technol Sch Taiyuan 030006 Peoples R China Anhui Univ Sci & Technol Dept Informat & Comp Sci Huainan 232001 Peoples R China Tongji Univ Dept Comp Sci & Engn Shanghai 201804 Peoples R China
出 版 物:《Frontiers of Computer Science》 (中国计算机科学前沿(英文版))
年 卷 期:2011年第5卷第1期
页 面:26-36页
核心收录:
学科分类:0711[理学-系统科学] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 08[工学] 081101[工学-控制理论与控制工程] 081201[工学-计算机系统结构] 0811[工学-控制科学与工程] 071102[理学-系统分析与集成] 081103[工学-系统工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:国家自然科学基金 Shanghai Rising-Star Program
主 题:Web service reliable service composition,service selection quality of service (QoS)
摘 要:With the development of Intemet and Web service technology, Web service composition has been an effective way to construct software applications; service selection is the crucial element in the composition process. However, the existing selection methods mostly generate static plans since they neglect the inherent stochastic and dynamic nature of Web services. As a result, Web service composition often inevitably terminates with failure. An indeterminacy-aware service selection algorithm based on an improved Markov decision process (IMDP) has been designed for reliable service composition, but it suffers from higher computation complexity. Therefore, an efficient method is proposed, which can reduce the computation cost by converting the service selection problem based on IMDP into solving a nonhomogeneous linear equation set. Experimental results demonstrate the success rate of service composition has been improved greatly, whilst also reducing computation cost.