Please wait a minute...
Shopping Cart Email List Chinese
Advanced Search Fig/Tab
Frontiers of Computer Science

ISSN 2095-2228

ISSN 2095-2236(Online)

CN 10-1014/TP

Postal Subscription Code 80-970

2018 Impact Factor: 1.129

Featured Articles  |  Most Downloaded  |  Most Reading
Online Submission Subscribe to Our RSS Content Feed
Front Comput Sci Chin    2011, Vol. 5 Issue (1) : 26-36    https://doi.org/10.1007/s11704-010-0077-4
RESEARCH ARTICLE
Indeterminacy-aware service selection for reliable service composition
Xiaoqin FAN1(), Xianwen FANG2, Zhijun DING3
1. Computer and Information Technology School, Shanxi University, Taiyuan 030006, China; 2. Department of Information and Computer Science, Anhui University of Science and Technology, Huainan 232001, China; 3. Department of Computer Science and Engineering, Tongji University, Shanghai 201804, China
 Download: PDF(282 KB)   HTML
 Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks
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 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.
Keywords Web service      reliable service composition      service selection      quality of service (QoS)     
Corresponding Author(s): FAN Xiaoqin,Email:fxq0917@ hotmail.com   
Issue Date: 05 March 2011
 Cite this article:   
Xiaoqin FAN,Xianwen FANG,Zhijun DING. Indeterminacy-aware service selection for reliable service composition[J]. Front Comput Sci Chin, 2011, 5(1): 26-36.
 URL:  
https://academic.hep.com.cn/fcs/EN/10.1007/s11704-010-0077-4
https://academic.hep.com.cn/fcs/EN/Y2011/V5/I1/26
Fig.1  Process model
Fig.1  Process model
Fig.2  State graph
Fig.2  State graph
Fig.3  Simulation results for single decision process. Performance against number of tasks. (a) Success rate; (b) computation cost
Fig.3  Simulation results for single decision process. Performance against number of tasks. (a) Success rate; (b) computation cost
Fig.4  Simulation results for two decision process. Performance against number of tasks. (a) Success rate; (b) computation cost
Fig.4  Simulation results for two decision process. Performance against number of tasks. (a) Success rate; (b) computation cost
1 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
2 Brogi A, Corfini S. Behaviour-aware discovery of Web service compositions. International Journal of Web Services Research , 2007, 4(3): 1-25
3 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
4 Chafle G, Dasgupta K, Kumar, . Adaptation in Web service composition and execution. In: Proceedings of IEEE International Conference on Web Services (ICWS'06) , 2006
doi: 10.1109/ICWS.2006.22
5 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
6 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
7 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
doi: 10.1109/ICWS.2008.22
8 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
9 Jorge S, Francisco P S, Marta, P M , . WS-replication: a framework for highly available Web services. In: Proceedings of World Wide Web Conference . 2006: 357-366
10 Guo H P, Huai J P. Li H, . ANGEL: Optimal configuration for high available service composition. In: Proceedings of International Conference on Web Services . 2007: 280-287
11 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
12 Girish, Koustuv, Arun, . Adaptation in Web service composition and execution. In: Proceedings of International Conference on Web Services . 2006: 549-557
13 Zeng L Z, Benatallah B, Dumas M. Quality driven Web service composition. In: Proceedings of the World Wide Web . 2003: 411-421
14 Hu Q Y, Liu J Y. An introduction to Markov decision processes. Xi’an: Xi’an Electronic Science Technology Press, 2000 (in Chinese)
15 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
16 Bylander T. Complexity results for planning. In: Proceedings of the 12th International Joint Conference on IJCAI , 1991: 274-279
17 Ardagna D, Pernici B. Adaptive service composition in flexible processes. IEEE Transactions on Software Engineering , 2007, 33(6): 369-384
doi: 10.1109/TSE.2007.1011
18 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
doi: 10.1109/TSC.2008.2
19 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
20 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
21 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)
22 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
[1] Jianpeng HU, Linpeng HUANG, Tianqi SUN, Ying FAN, Wenqiang HU, Hao ZHONG. Proactive planning of bandwidth resource using simulation-based what-if predictions forWeb services in the cloud[J]. Front. Comput. Sci., 2021, 15(1): 151201-.
[2] Meysam VAKILI, Neda JAHANGIRI, Mohsen SHARIFI. Cloud service selection using cloud service brokers: approaches and challenges[J]. Front. Comput. Sci., 2019, 13(3): 599-617.
[3] Xiaodong FU,Kun YUE,Li LIU,Ping ZOU,Yong FENG. Discovering admissibleWeb services with uncertain QoS[J]. Front. Comput. Sci., 2015, 9(2): 265-279.
[4] Hadi SABOOHI, Sameem ABDUL KAREEM. An automatic subdigraph renovation plan for failure recovery of composite semantic Web services[J]. Front Comput Sci, 2013, 7(6): 894-913.
[5] Rong ZHANG, Koji ZETTSU, Yutaka KIDAWARA, Yasushi KIYOKI, Aoying ZHOU. Context-sensitive Web service discovery over the bipartite graph model[J]. Front Comput Sci, 2013, 7(6): 875-893.
[6] Hongli YANG, Chao CAI, Liyang PENG, Xiangpeng ZHAO, Zongyan QIU, Shengchao QIN. Algorithms for checking channel passing in web service choreography[J]. Front Comput Sci, 2013, 7(5): 710-728.
[7] KASEM Asem, IDA Tetsuo. Computational origami environment on the web[J]. Front. Comput. Sci., 2008, 2(1): 39-54.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed