Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join

Balancing of structured peer-to-peer graphs, including their zone sizes, has recently become an important topic of distributed hash table (DHT) research. To bring analytical understanding into the various peer-join mechanisms based on consistent hashing, we study how zone-balancing decisions made during the initial sampling of the peer space affect the resulting zone sizes and derive several asymptotic bounds for the maximum and minimum zone sizes that hold with high probability. Several of our results contradict those of prior work and shed new light on the theoretical performance limitations of consistent hashing. We use simulations to verify our models and compare the performance of the various methods using the example of recently proposed de Bruijn DHTs.

[1]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[2]  W. Szpankowski,et al.  Limit Laws for Heights in Generalized Tries and PATRICIA Tries , 1999 .

[3]  D. Darling.  On a Class of Problems Related to the Random Division of an Interval , 1953 .

[4]  Dmitri Loguinov,et al.  On zone-balancing of peer-to-peer networks: analysis of random node join , 2004, SIGMETRICS '04/Performance '04.

[5]  M I C H A E L M I T Z E N M A C H,et al.  Studying Balanced Allocations with Differential Equations † , 1999 .

[6]  David R. Karger,et al.  New Algorithms for Load Balancing in Peer-to-Peer Systems , 2003 .

[7]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[8]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[9]  Michael Mitzenmacher,et al.  Load balancing and density dependent jump Markov processes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  Abhishek Kumar,et al.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE J. Sel. Areas Commun..

[11]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[12]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[13]  L. Devroye.  Laws of the Iterated Logarithm for Order Statistics of Uniform Spacings , 1981 .

[14]  Pierre Fraigniaud,et al.  The content-addressable network d2b , 2003 .

[15]  Philippe Jacquet,et al.  Limiting Distribution for the Depth in Patricia Tries , 1993, SIAM J. Discret. Math..

[16]  Richard M. Karp,et al.  A stochastic process on the hypercube with applications to peer-to-peer networks , 2003, STOC '03.

[17]  Eugene P. Wigner,et al.  Formulas and Theorems for the Special Functions of Mathematical Physics , 1966 .

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  Anirban Mondal,et al.  Effective load-balancing of peer-to-peer systems , 2003 .

[20]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[21]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[22]  Hsien-Kuei Hwang,et al.  Asymptotic Estimates of Elementary Probability Distributions , 1997 .

[23]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[24]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[25]  Yiming Hu,et al.  Efficient, proximity-aware load balancing for DHT-based P2P systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[26]  Gaston H. Gonnet,et al.  On the LambertW function , 1996, Adv. Comput. Math..

[27]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[28]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[29]  B. Vocking.  How asymmetry helps load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[30]  Ching Law,et al.  Distributed construction of random expander graphs , 2003, INFOCOM 2003.

[31]  Karl Aberer,et al.  The Quest for Balancing Peer Load in Structured Peer-to-Peer Systems , 2003 .

[32]  Mary Baker,et al.  Practical load balancing for content requests in peer-to-peer networks , 2002, Distributed Computing.

[33]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[34]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[35]  Luc Devroye,et al.  A Log Log Law for Maximal Uniform Spacings , 1982 .

[36]  Friedhelm Meyer auf der Heide,et al.  Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.

[37]  Hein Meling,et al.  Messor: Load-Balancing through a Swarm of Autonomous Agents , 2002, AP2PC.

[38]  Jeffrey Considine,et al.  Geometric generalizations of the power of two choices , 2004, SPAA '04.

[39]  James Aspnes,et al.  Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.

[40]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[41]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.