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.
Similar content being viewed by others
References
Majithia S, Walker D W, Gray W A. A framework for automated service composition in service-oriented architectures. In: Proceedings of the European Semantic Web Symposium 2004. Berlin: Springer-Verlag, 2004: 269–283
Brogi A, Corfini S. Behaviour-aware discovery of Web service compositions. International Journal of Web Services Research, 2007, 4(3): 1–25
Oh S C, Lee D, Kumara S R T. Web service Planner (WsPr): an effective and scalable web service web composition algorithm. International Journal of Web Services Research, 2007, 4(1): 1–23
Chafle G, Dasgupta K, Kumar, et al. Adaptation in Web service composition and execution. In: Proceedings of IEEE International Conference on Web Services (ICWS’06), 2006
Yang L, Dai Y, Zhang B. Performance prediction based EX-QoS driven approach for adaptive service composition. Journal of Information Science and Engineering, 2009, 25(2): 345–362
Vu, L.H, Hauswirth, M, Aberer, K. QoS-based service selection and ranking with trust and reputation management. In: Proceedings of 13th International Conference on Cooperative Information Systems. 2005: 466–483
Mei L J, Chan W K, Tse T H. An adaptive service selection approach to service composition. In: Proceedings of IEEE International Conference on Web Service. 2008: 70–77
Canfora, G, Penta, MD, Esposito, R, Villani, ML. QoS-aware replanning of composite Web services. In: Proceedings of International Conference on Web Services. 2005: 121–129
Jorge S, Francisco P S, Marta, P M, et al. WS-replication: a framework for highly available Web services. In: Proceedings of World Wide Web Conference. 2006: 357–366
Guo H P, Huai J P. Li H, et al. ANGEL: Optimal configuration for high available service composition. In: Proceedings of International Conference on Web Services. 2007: 280–287
Yu T, Lin K J. Adaptive algorithms for finding replacement services in autonomic distributed business processes. In: Proceedings of International Symposium on Autonomous Decentralized Systems. 2005: 427–434
Girish, Koustuv, Arun, et al. Adaptation in Web service composition and execution. In: Proceedings of International Conference on Web Services. 2006: 549–557
Zeng L Z, Benatallah B, Dumas M. Quality driven Web service composition. In: Proceedings of the World Wide Web. 2003: 411–421
Hu Q Y, Liu J Y. An introduction to Markov decision processes. Xi’an: Xi’an Electronic Science Technology Press, 2000 (in Chinese)
Doshi P, Goodwin R, Akkiraju R, Verma K. Dynamic workflow composition using Markov decision processes. International Journal of Web Services Research, 2005, 2(1): 1–17
Bylander T. Complexity results for planning. In: Proceedings of the 12th International Joint Conference on IJCAI, 1991: 274–279
Ardagna D, Pernici B. Adaptive service composition in flexible processes. IEEE Transactions on Software Engineering, 2007, 33(6): 369–384
Hwang S Y, Lim E P, Lee C H, Chen C H. Dynamic Web service selection for reliable Web service composition. IEEE Transactions on Services Computing, 2008, 1(2): 104–116
Fan X Q, Jiang C J, Fang X W, Ding Z J. Dynamic Web service selection based on discrete particle swarm optimization. Journal of Computer Research and Development, 2010, 47(1): 147–156
Yu T, Zhang Y, Lin K J. Efficient algorithms for Web services selection with end-to end QoS constraints. ACM Transactions on the Web, 2007, 1(1): Article No.6
Zhang C W, Su S, Chen J L. Genetic algorithm on Web services selection supporting QoS. Chinese Journal of computer, 2006, 29(7): 1029–1037 (in Chinese)
Gao A Q, Yang D Q, Tang S W, Zhang M. Web service composition using Markov decision processes. In: Proceedings of the 6th Web-Age Information Management, LNCS 3739, 2005: 308–319
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, X., Fang, X. & Ding, Z. Indeterminacy-aware service selection for reliable service composition. Front. Comput. Sci. China 5, 26–36 (2011). https://doi.org/10.1007/s11704-010-0077-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-010-0077-4