Peer-to-peer systems for prefix search

Authors:
Baruch Awerbuch;Christian Scheideler
Affiliations:
Johns Hopkins University, Baltimore, MD;Johns Hopkins University, Baltimore, MD
Venue:
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Year:
2003

Citing 14
Cited 16

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
On name resolution in peer-to-peer networks

Proceedings of the second ACM international workshop on Principles of mobile computing
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Skip Lists: A Probabilistic Alternative to Balanced Trees

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Parallel Dictionaries in 2-3 Trees

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Complex Queries in DHT-based Peer-to-Peer Networks

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
Novel architectures for P2P applications: the continuous-discrete approach

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Fault tolerant data structures

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

Load balancing and locality in range-queriable data structures

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A case study in building layered DHT applications

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Skip graphs

ACM Transactions on Algorithms (TALG)
Wildcard Search in Structured Peer-to-Peer Networks

IEEE Transactions on Knowledge and Data Engineering
Approaching neighbor proximity and load balance for range query in P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and implementation trade-offs for wide-area resource discovery

ACM Transactions on Internet Technology (TOIT)
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

Proceedings of the 28th ACM symposium on Principles of distributed computing
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
PRoBe: multi-dimensional range queries in p2p networks

WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Brushwood: distributed trees in peer-to-peer systems

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Adapting the content native space for load balanced indexing

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Skip b-trees

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Building a network-aware and load-balanced peer-to-peer system for range queries

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a general methodology for building message-passing peer-to-peer systems capable of performing prefix search for arbitrary user-defined names. Our methodology allows to achieve even load distribution, high fault-tolerance, and low-congestion concurrent query execution. This is the, first known peer-to-peer system for prefix search with such properties. The essence of this methodology is a plug and play paradigm for designing a peer-to-peer system as a modular composition of arbitrary concurrent data structures.