Indeterminacy-aware service selection for reliable service composition

  • Authors:
  • Xiaoqin Fan;Xianwen Fang;Zhijun Ding

  • Affiliations:
  • Computer and Information Technology School, Shanxi University, Taiyuan, China 030006;Department of Information and Computer Science, Anhui University of Science and Technology, Huainan, China 232001;Department of Computer Science and Engineering, Tongji University, Shanghai, China 201804

  • Venue:
  • Frontiers of Computer Science in China
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the development of Internet 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 algorithmbased 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.