Journal of the ACM (JACM)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Dynamic Interpolation Search in o(log log n) Time
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
A Peer-to-Peer Approach to Web Service Discovery
World Wide Web
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
P-tree: a p2p index for resource discovery applications
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Non-Uniform Deterministic Routing on F-Chord (")
HOT-P2P '04 Proceedings of the 2004 International Workshop on Hot Topics in Peer-to-Peer Systems
Information Technology and Management
Efficient Access to Web Services
IEEE Internet Computing
On automating Web services discovery
The VLDB Journal — The International Journal on Very Large Data Bases
A semantic-link-based infrastructure for web service discovery in P2P networks
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Peer-to-peer management of XML data: issues and research challenges
ACM SIGMOD Record
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Speeding up search in peer-to-peer networks with a multi-way tree structure
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Leveraging web-services and peer-to-peer networks
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Building an efficient P2P overlay for energy-level queries in sensor networks
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Digital watermarking in peer to peer networks
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
SART: dynamic P2P query processing in sensor networks with probabilistic guarantees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
VAST'08 Proceedings of the 9th International conference on Virtual Reality, Archaeology and Cultural Heritage
SART: speeding up query processing in sensor networks with an autonomous range tree structure
ACM SIGAPP Applied Computing Review
| Hi-index | 0.00 |
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.