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
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
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
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
Load-driven neighbourhood reconfiguration of Gnutella overlay
Computer Communications
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA)
Proceedings of the 2010 ACM Symposium on Applied Computing
Balls into bins with related random choices
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer 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
A structured peer-to-peer system with integrated index and storage load balancing
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Balls into bins with related random choices
Journal of Parallel and Distributed Computing
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
A fault-tolerant cache service for web search engines: RADIC evaluation
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Web search results caching service for structured P2P networks
Future Generation Computer Systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In Peer-to-Peer networks based on consistent hashing and ring topology, each server is responsible for an interval chosen (pseudo-) randomly on a unit circle. The topology of the network, the communication load, and the amount of data a server stores depend heavily on the length of its interval. Additionally, the nodes are allowed to join the network or to leave it at any time. Such operations can destroy the balance of the network, even if all the intervals had equal lengths in the beginning. This paper deals with the task of keeping such a system balanced, so that the lengths of intervals assigned to the nodes differ at most by a constant factor. We propose a simple fully distributed scheme, which works in a constant number of rounds and achieves optimal balance with high probability. Each round takes time at most $\mathcal{O}(\mathcal{D}+{\rm log n})$, where $\mathcal{D}$ is the diameter of a specific network (e.g. Θ(log n) for Chord [15] and $\Theta(\frac{log n}{log log n})$ for the continous-discrete approach proposed by Naor and Wieder [12,11]). The scheme is a continuous process which does not have to be informed about the possible imbalance or the current size of the network to start working. The total number of migrations is within a constant factor from the number of migrations generated by the optimal centralized algorithm starting with the same initial network state.