Complex Network Theory Based Web Services Composition Benchmark Toolkit

In recent years, while many research proposals have been made toward novel algorithmic solutions of a myriad of web services composition problems, their validation has been less than satisfactory. One of the reasons for this problem is the lack of real benchmark web services data with which researchers can test and verify their proposals. In this chapter, to remedy this challenge, we present a novel benchmark toolkit, WSBen, which is capable of generating synthetic web services data with diverse scenarios and configurations using complex network theory. Web services researchers therefore can evaluate their web services discovery and composition algorithms in a more systematic fashion. The development of WSBen is inspired by our preliminary study on real-world web services crawled from the Web. The proposed WSBen can: (1) generate a collection of synthetic web services files in the WSDL format conforming to diverse complex network characteristics; (2) generate queries and ground truth sets for testing discovery and composition algorithms; (3) prepare auxiliary files to help further statistical analysis; (4) convert WSDL test sets to the formats that conventional AI planners can read; and (5) provide a graphical interface to control all these functions. To illustrate the application of the WSBen, in addition, we present case studies selected from three domains: (1) web services composition; (2) AI planning; and (3) the laws of networks in Physics community. The WSBen toolkit is available at: http://pike.psu.edu/sw/wsben/. This chapter is an invited extension of authors’ previous publication (Oh & Lee, 2009).

[1]  Andreas Wombacher,et al.  WSC-07: Evolving the Web Services Challenge , 2007, The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007).

[2]  Hans-Arno Jacobsen,et al.  Distributed automatic service composition in large-scale systems , 2008, DEBS.

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

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

[5]  Tran Cao Son,et al.  Adapting Golog for Composition of Semantic Web Services , 2002, KR.

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

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

[8]  James A. Hendler,et al.  HTN planning for Web Service composition using SHOP2 , 2004, J. Web Semant..

[9]  Farhad Mavaddat,et al.  A Graph-Based Framework for Composition of Stateless Web Services , 2006, 2006 European Conference on Web Services (ECOWS'06).

[10]  Jordi Delgado,et al.  Emergence of social conventions in complex networks , 2002, Artif. Intell..

[11]  Peter J. Denning The social life of innovation , 2004, CACM.

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

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

[14]  Fabio Casati,et al.  eFlow: a platform for developing and managing composite e-services , 2000, Proceedings Academia/Industry Working Conference on Research Challenges '00. Next Generation Enterprises: Virtual Organizations and Mobile/Pervasive Technologies. AIWORC'00. (Cat. No.PR00628).

[15]  Drew McDermott,et al.  Estimated-Regression Planning for Interactions with Web Services , 2002, AIPS.

[16]  Kurt Geihs,et al.  The Web Service Challenge - A review on Semantic Web Service Composition , 2009 .

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

[18]  Soundar R. T. Kumara,et al.  WSBen: A Web Services Discovery and Composition Benchmark , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[19]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[20]  Daniel M. Zimmerman,et al.  Automatic Web Services Generation , 2009 .

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

[22]  Dmytro Zhovtobryukh,et al.  A Petri Net-based Approach for Automated Goal-Driven Web Service Composition , 2007, Simul..

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

[24]  Stanley Y. W. Su,et al.  AND/OR Graph and Search Algorithm for Discovering Composite Web Services , 2005, Int. J. Web Serv. Res..

[25]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[26]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[27]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Eyhab Al-Masri,et al.  Investigating web services on the world wide web , 2008, WWW.

[29]  Miroslaw Malek,et al.  Search Strategies for Automatic Web Service Composition , 2006, Int. J. Web Serv. Res..

[30]  Quan Z. Sheng,et al.  The Self-Serv Environment for Web Services Composition , 2003, IEEE Internet Comput..

[31]  Soo-Ho Chang,et al.  The LLAMA Middleware Support for Accountable Service-Oriented Architecture , 2008, ICSOC.

[32]  Soundar R. T. Kumara,et al.  Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm , 2007, Int. J. Web Serv. Res..

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

[34]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[35]  Soundar R. T. Kumara,et al.  Effective Web Service Composition in Diverse and Large-Scale Service Networks , 2008, IEEE Transactions on Services Computing.