STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Stability and Efficiency of a Random Local Load Balancing Protocol
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Efficient algorithms for new computational models
Efficient algorithms for new computational models
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Mirinae: A peer-to-peer overlay network for large-scale content-based publish/subscribe systems
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Passive/Active Load Balancing with Informed Node Placement in DHTs
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Load balancing for moving object management in a P2P network
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
A Read-Only Distributed Hash Table
Journal of Grid Computing
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
S-Chord: hybrid topology makes chord efficient
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A structured overlay for multi-dimensional range queries
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A dynamic load balancing strategy with the push and pull approaches in DHT networks
Computers and Electrical Engineering
ID-replication for structured peer-to-peer systems
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks
Computers and Electrical Engineering
Hi-index | 0.00 |
Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord’s logarithmic query time and near-optimal data migration cost. Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items “randomly” into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three). Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized – for example, if we wish to support range-searches on “ordered” keys. We give a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed.” As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data.