Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm

As the emergence of service-oriented architecture provides a major boost for e-commerce agility, the number of available Web services is rapidly increasing. However, when there are a large number of Web services available and no single Web service satisfies the given request, one has to “compose†multiple Web services to fulfill the goal. In this article, toward this problem, we present an AI planning-based Web service composition algorithm named as WSPR. We evaluate the efficiency and effectiveness of WSPR using two publicly available test sets—EEE05 and ICEBE05. In addition, we analyze the two test sets and suggest several improvements to benchmark Web service composition better.

[1]  Byung-Won On,et al.  BF*: Web services discovery and composition as graph search problem , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[2]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[3]  Gerhard Weikum,et al.  XML-enabled workflow management for e-services across heterogeneous platforms , 2001, The VLDB Journal.

[4]  Liang-Jie Zhang,et al.  Web Services Quality Testing , 2005 .

[5]  Amit P. Sheth,et al.  Adding Semantics to Web Services Standards , 2003, ICWS.

[6]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[7]  Prashant Doshi,et al.  Dynamic workflow composition using Markov decision processes , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[8]  Subbarao Kambhampati,et al.  A snapshot of public web services , 2005, SGMD.

[9]  Craig A. Knoblock,et al.  Proteus: A System for Dynamically Composing and Intelligently Executing Web Services , 2003, ICWS.

[10]  Antonio Pumariño,et al.  The binding point , 1997 .

[11]  Peter J. Denning.  Network laws , 2004, CACM.

[12]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[13]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[14]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[15]  Dana S. Nau,et al.  On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[16]  Soundar R. T. Kumara,et al.  A comparative illustration of AI planning-based web services composition , 2006, SECO.

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

[18]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[19]  Shankar Ponnekanti,et al.  SWORD: A Developer Toolkit for Web Service Composition , 2008 .

[20]  Daniel S. Weld,et al.  Planning to Gather Information , 1996, AAAI/IAAI, Vol. 1.

[21]  Vassilis Christophides,et al.  Onthology-Driven Integration of Scientific Repositories , 1999, NGITS.

[22]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[23]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[24]  Boi Faltings,et al.  Large scale testbed for type compatible service composition , 2004 .

[25]  Jun Zhang,et al.  Simlarity Search for Web Services , 2004, VLDB.

[26]  F. Tahan.  From the authors , 2007, European Respiratory Journal.

[27]  Craig A. Knoblock,et al.  Web service composition as planning , 2003 .

[28]  Xiaomeng Su,et al.  A Survey of Automated Web Service Composition Methods , 2004, SWSWPC.

[29]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[30]  Bertram Ludäscher,et al.  A Web service composition and deployment framework for scientific workflows , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[31]  Nils J. Nilsson,et al.  Artificial Intelligence: A New Synthesis , 1997 .