Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

NBDT: an efficient P2P indexing scheme for web service discovery

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Engineering and Technology Inderscience Publishers

NBDT: an efficient P2P indexing scheme for web service discovery

Download PDF
19 pages

Loading next page...
 
/lp/inderscience-publishers/nbdt-an-efficient-p2p-indexing-scheme-for-web-service-discovery-RTQDfsEbPa
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1476-1289
eISSN
1741-9212
DOI
10.1504/IJWET.2008.016106
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

International Journal of Web Engineering and Technology – Inderscience Publishers

Published: Jan 1, 2008

There are no references for this article.