SPiDeR: P2P-Based Web Service Discovery

In this paper, we describe SPiDeR, a peer-to-peer (P2P) based framework that supports a variety of Web service discovery operations. SPiDeR organizes the service providers into a structured P2P overlay and allows them to advertise and lookup services in a completely decentralized and dynamic manner. It supports three different kinds of search operations: For advertising and locating services, service providers can use keywords extracted from service descriptions (keyword-based search), categories from a global ontology (ontology-based search), and/or paths from the service automaton (behavior-based search). The users can also rate the quality of the services they use. The ratings are accumulated within the system so that users can query for the quality ratings of the discovered services. Finally, we present the performance of SPiDeR in terms of routing using a simulator.

[1]  Chris Buckley,et al.  Implementation of the SMART Information Retrieval System , 1985 .

[2]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[3]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[4]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[5]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[6]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[7]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[8]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

[9]  Wolfgang Nejdl,et al.  A scalable and ontology-based P2P infrastructure for Semantic Web Services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[10]  Rajeev Rastogi,et al.  RE-tree: an efficient index structure for regular expressions , 2003, The VLDB Journal.

[11]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[12]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[13]  Katia P. Sycara,et al.  Using DAML-S for P2P Discovery , 2003, International Conference on Web Services.

[14]  Mike P. Papazoglou,et al.  Leveraging Web-Services and Peer-to-Peer Networks , 2003, CAiSE.

[15]  Xiang Fu,et al.  WSAT: A Tool for Formal Analysis of Web Services , 2004, CAV.

[16]  Manish Parashar,et al.  A Peer-to-Peer Approach to Web Service Discovery , 2004, World Wide Web.

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

[18]  Divyakant Agrawal,et al.  A peer-to-peer framework for Web service discovery with ranking , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[19]  Jianwen Su,et al.  Web service discovery based on behavior signatures , 2005, 2005 IEEE International Conference on Services Computing (SCC'05) Vol-1.

[20]  Tanveer F. Syeda-Mahmood,et al.  Searching service repositories by combining semantic and ontological matching , 2005, IEEE International Conference on Web Services (ICWS'05).

[21]  Tatsuya Hagino,et al.  Proceedings of the 14th international conference on World Wide Web , 2005 .

[22]  Amit P. Sheth,et al.  METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services , 2005, Inf. Technol. Manag..

[23]  Peter Fankhauser,et al.  A grammar-based index for matching business processes , 2005, IEEE International Conference on Web Services (ICWS'05).

[24]  Boi Faltings,et al.  Flexible and efficient matchmaking and ranking in service directories , 2005, IEEE International Conference on Web Services (ICWS'05).

[25]  Gustavo Alonso,et al.  Web Services: Concepts, Architectures and Applications , 2009 .