A Cost-Effective Planning Graph Approach for Large-Scale Web Service Composition

Web Service Composition (WSC) problems can be considered as a service matching problem, which means that the output parameters of a Web service can be used as inputs of another one. However, when a very large number of Web services are deployed in the environment, the service composition has become sophisticated and complicated process. In this study, we proposed a novel cost-effective Web service composition mechanism. It utilizes planning graph based on backward search algorithm to find multiple feasible solutions and recommends a best composition solution according to the lowest service cost. In other words, the proposed approach is a goal-driven mechanism, which can recommend the approximate solutions, but it consumes fewer amounts of Web services and less nested levels of composite service. Finally, we implement a simulation platform to validate the proposed cost-effective planning graph mechanism in large-scale Web services environment. The simulation results show that our proposed algorithm based on the backward planning graph has reduced by 94% service cost in three different environments of service composition that is compared with other existing service composition approaches which are based on a forward planning graph.

[1]  Patrice Moreaux,et al.  An Integrated Framework for Web Services Orchestration , 2009, Int. J. Web Serv. Res..

[2]  David M. Booth,et al.  Web Services Architecture , 2004 .

[3]  Liang Chang,et al.  Context optimization of AI planning for semantic Web services composition , 2007, Service Oriented Computing and Applications.

[4]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[5]  Joachim Peer,et al.  Web Service Composition as AI Planning { a Survey ⁄ , 2005 .

[6]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[7]  Yuhong Yan,et al.  A Planning Graph Based Algorithm for Semantic Web Service Composition , 2008, 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services.

[8]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[9]  Dongwon Lee,et al.  WSBen: A Web Services Discovery and Composition Benchmark Toolkit1 , 2009, Int. J. Web Serv. Res..

[10]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

[11]  Weiming Shen,et al.  Agent based workflow ontology for dynamic business process composition , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..

[12]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[13]  Mehmet Kuzu,et al.  Dynamic planning approach to automated web service composition , 2010, Applied Intelligence.

[14]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[15]  Yuhong Yan,et al.  An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model , 2008, 2008 IEEE International Conference on Web Services.