NBDT: an efficient P2P indexing scheme for web service discovery

In this paper, we propose a new infrastructure for web services discovery in P2P networks, the Nested Balanced Distributed Tree (NBDT). Peers that store web services information, such as data item descriptions, are efficiently located using a scalable and robust data indexing structure based on a NBDT. The key innovation is that the solution is based on a totally new infrastructure, which is not vulnerable to classic disadvantages. We present a theoretical analysis backed up by experimental results, which shows that the communication cost of query and update operations scale sublogarithmically in the worst case with the number of NBDT nodes, outperforming three of the most popular decentralised infrastructures: Chord (and some of its successors), BATON (and its successor) and Skip Graphs. Furthermore, we show that the network is robust to failures providing quality of web services requirements.

[1]  Beng Chin Ooi,et al.  Speeding up search in peer-to-peer networks with a multi-way tree structure , 2006, SIGMOD Conference.

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

[3]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[4]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[5]  Johannes Gehrke,et al.  P-tree: a p2p index for resource discovery applications , 2004, WWW Alt. '04.

[6]  Evaggelia Pitoura,et al.  Peer-to-peer management of XML data: issues and research challenges , 2005, SGMD.

[7]  Michael T. Goodrich,et al.  The rainbow skip graph: a fault-tolerant constant-degree distributed data structure , 2006, SODA '06.

[8]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

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

[10]  Beng Chin Ooi,et al.  BATON: A Balanced Tree Structure for Peer-to-Peer Networks , 2005, VLDB.

[11]  Kurt Mehlhorn,et al.  Dynamic interpolation search , 1985, JACM.

[12]  Athman Bouguettaya,et al.  Efficient access to Web services , 2004, IEEE Internet Computing.

[13]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[14]  Christos Makris,et al.  Improved Bounds for Finger Search on a RAM , 2003, ESA.

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

[16]  Mohand-Said Hacid,et al.  On automating Web services discovery , 2003, The VLDB Journal.

[17]  Gaston H. Gonnet,et al.  An algorithmic and complexity analysis of interpolation search , 2004, Acta Informatica.

[18]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[19]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[20]  Jianwei Liu,et al.  Decentralized Web Service Organization Combining Semantic Web and Peer to Peer Computing , 2004, ECOWS.

[21]  Futai Zou,et al.  PWSD: A Scalable Web Service Discovery Architecture Based on Peer-to-Peer Overlay Network , 2004, APWeb.

[22]  Anupriya Ankolekar,et al.  Automated discovery, interaction and composition of Semantic Web services , 2003, J. Web Semant..

[23]  Jie Liu,et al.  A semantic-link-based infrastructure for web service discovery in P2P networks , 2005, WWW '05.

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

[25]  Dan E. Willard.  Searching Unindexed and Nonuniformly Generated Files in log log N Time , 1985, SIAM J. Comput..

[26]  Ramesh Govindan,et al.  Incrementally improving lookup latency in distributed hash table systems , 2003, SIGMETRICS '03.

[27]  Gurmeet Singh Manku,et al.  Optimal routing in Chord , 2004, SODA '04.

[28]  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..

[29]  Minglu Li,et al.  pXRepository: A Peer-to-Peer XML Repository for Web Service Discovery , 2004, GCC.

[30]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[31]  M. Hammar,et al.  Non-uniform deterministic routing on F-Chord(/spl alpha/) , 2004, 2004 International Workshop on Hot Topics in Peer-to-Peer Systems.

[32]  Arne Andersson,et al.  Dynamic Interpolation Search in o(log log n) Time , 1993, ICALP.

[33]  Munindar P. Singh,et al.  Service-Oriented Computing: Semantics, Processes, Agents , 2010 .

[34]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.