Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Dynamically Fault-Tolerant Content Addressable 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
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE 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
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Query Processing to Efficient Search in Ubiquitous Computing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Dynamic Querying in Structured Peer-to-Peer Networks
DSOM '08 Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment
Parallel Load Balancing Strategies for Tree-Structured Peer-to-Peer Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Distance-based bloom filter for an efficient search in mobile ad hoc networks
Proceedings of the 2007 conference on Human interface: Part I
Keyword search in DHT-based peer-to-peer networks
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Efficient search technique for agent-based P2P information retrieval
AIS-ADM'07 Proceedings of the 2nd international conference on Autonomous intelligent systems: agents and data mining
Enabling Dynamic Querying over Distributed Hash Tables
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A number of structured peer-to-peer (P2P) lookup protocols have been proposed recently. A P2P lookup protocol routes a lookup request to its target node in a P2P distributed system. Existing protocols achieve balanced routing traffic among nodes by assuming that lookup requests are evenly targeted at every node. However, when lookup requests concentrate on a few nodes simultaneously, these nodes become hot spots. Due to uneven routing patterns in existing protocols, hot spots cause unbalanced routing traffic which leads to routing bottlenecks. In this paper, we present a novel structured P2P lookup protocol called SCALLOP that delivers balanced routing and avoids routing bottlenecks at occurrences of hot spots. Among existing protocols, SCALLOP is the first one to accomplish this goal at the fundamental nature of a routing protocol. SCALLOP achieves balanced routing by uniquely constructing a balanced lookup tree for each node. The balanced tree evenly distributes routing traffic among sibling nodes and, therefore, avoids or reduces routing bottlenecks. In addition, as a load-balanced protocol, SCALLOP delivers asymptotically optimal lookup performance at the tradeoff between routing path and routing table size. We conducted a set of simulations to demonstrate the effectiveness of SCALLOP. The results show that, compared with a most-referenced and representative structured P2P lookup protocol and a graph-based extension of this protocol, SCALLOP significantly reduces routing bottlenecks while all three protocols deliver comparable lookup performance.