Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options
The VLDB Journal — The International Journal on Very Large Data Bases
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Distributed online aggregations
Proceedings of the VLDB Endowment
Balancing reducer skew in MapReduce workloads using progressive sampling
Proceedings of the Third ACM Symposium on Cloud Computing
Web search results caching service for structured P2P networks
Future Generation Computer Systems
| Hi-index | 0.00 |
Consistent hashing can be used to assign objects to nodes in a distributed system. It has been used by several distributed systems including Chord, Pastry, and Tornado because of its efficient handling of node failure and repair. In this paper we analyze how well consistent hashing does at evenly distributing objects among the nodes in the system. We also extend current consistent hashing algorithms to allow for dynamic load balancing while retaining the good properties of consistent hashing. Finally we analyze our extensions using both probabilistic analysis and simulations. The algorithms derived appear to achieve much better load balancing.