July 5, 2004 to July 7, 2004
Garret Swart , University College Cork
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.47
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.
Distributed information systems, Combinatorial mathematics, Distributed algorithms, Load modeling
Garret Swart, "Spreading the Load Using Consistent Hashing: A Preliminary Report", ISPDC, 2004, Parallel and Distributed Computing, International Symposium on, Parallel and Distributed Computing, International Symposium on 2004, pp. 169-176, doi:10.1109/ISPDC.2004.47