Load-balancing performance of consistent hashing: Asymptotic analysis of random node join

IEEE/ACM Transactions on Networking

Volumn 15, Issue 4, 2007, Pages 892-905

  Wang, Xiaoming ^a   Loguinov, Dmitri ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Asymptotic bounds; Balls into bins; Consistent hashing; Load balancing; Peer to peer (P2P)

Indexed keywords

ASYMPTOTIC BOUNDS; BALLS-INTO-BINS; CONSISTENT HASHING; LOAD BALANCING; PEER-TO-PEER (P2P);

BINS; FAULT TOLERANCE; QUALITY ASSURANCE;

ASYMPTOTIC ANALYSIS;

EID: 38349187174     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.893881     Document Type: Article

References (43)

1. K. Aberer, A. Datta, and M. Hauswirth, The quest for balancing peer load in structured peer-to-peer systems EPFL, Tech. Rep., 2003.
2. M. Adler, E. Halperin, R. M. Karp, and V. V. Vazirani, "A stochastic process on the hypercube with applications to peer-to-peer networks," in Prooc. ACM STOC, Jun. 2003, pp. 575-584.
3. J. Aspnes, Z. Diamadi, and G. Shah, "Fault-tolerant routing in peer-to-peer systems," in ACM PODC, Jul. 2002, pp. 223-232.
4. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced allocations," SIAM J. Comput., vol. 29, pp. 180-200, Jul. 1999.
5. J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices," in ACM SPAA, Jun. 2004, pp. 54-63.
6. J. Byers, J. Considine, and M. Mitzenmacher, "Simple load balancing for distributed hash tables," in IPTPS, Feb. 2003, pp. 80-87.
7. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making gnutella-like P2P systems scalable," in ACM SIGCOMM, Aug. 2003, pp. 407-418.
8. R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth, "On the Lambert W function," Adv. Comput. Math., vol. 5, pp. 329-359, 1996.
9. D. A. Darling, "On a class of problems related to the random division of an interval," Ann. Math. Stat., vol. 24, pp. 239-253, Jun. 1953.
10. L. Devroye, "Law of the iterated logarithm for order statistics of uniform spacings," Ann. Prob., vol. 9, no. 5, pp. 860-867, 1981.
11. L. Devroye, "A log-log law for maximal uniform spacings," Ann. Prob., vol. 10, no. 35, pp. 863-868, 1982.
12. P. Fraigniaud and P. Gauron, The content-addressable network D2B CNRS Univ. Paris Sud, Paris, France, Tech. Rep. 1349, 2003.
13. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load balancing in dynamic structured P2P systems," in Proc. IEEE INFOCOM, Mar. 2004, pp. 2253-2262.
14. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
15. H.-K. Hwang, "Asymptotic estimates of elementary probability distributions," Stud. Appl. Math., vol. 99, pp. 393-417, Nov. 1997.
16. F. Kaashoek and D. Karger, "Koorde: A simple degree-optimal hash table," in Proc. IPTPS, Feb. 2003, pp. 98-107.
17. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web," in ACM STOC, May 1997, pp. 654-663.
18. D. Karger and M. Ruhl, "New algorithms for load balancing in peer-to-peer systems," in IRIS Student Workshop, Aug. 2003.
19. R. M. Karp, M. Luby, and F. Meyer auf der Heide, "Efficient PRAM simulation on a distributed memory machine," in ACM STOC, May 1992, pp. 318-326.
20. C. Knessl and W. Szpankowski, "Limit laws for heights in generalized tries and Patricia tries," J. Alg., vol. 44, pp. 63-97, 2002.
21. T. G. Kurtz, "Solutions of ordinary differential equations as limits of pure jump Markov processes," J. Appl. Prob., vol. 7, pp. 49-58, 1970.
22. C. Law and K.-Y. Siu, "Distributed construction of random expander graphs," in Proc. IEEE INFOCOM, Mar. 2003, pp. 2133-2143.
23. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer networks," in ACM PODC, Jul. 2002, pp. 233-242.
24. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience," in ACM SIGCOMM, Aug. 2003, pp. 395-406.
25. W. Magnus, F. Oberhettinger, and R. P. Soni, Formulas and Theorems for the Special Functions of Mathematical Physics. Berlin, Germany: Springer-Verlag, 1966.
26. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in ACM PODC, Jul. 2002, pp. 183-192.
27. M. Mitzenmacher, "Load balancing and density dependent jump Markov processes," in IEEE FOCS, Oct. 1996, pp. 213-222.
28. M. Mitzenmacher, "Studying balanced allocations with differential equations," Combin., Prob., Comput., vol. 8, pp. 473-482, Sep. 1999.
29. M. Mitzenmacher, "The power of two choices in randomized load balancing," Ph.D. dissertation, Univ. California, Berkeley, 1996.
30. A. Mondal, K. Goda, and M. Kitsuregawa, "Effective load-balancing of peer-to-peer systems," in Data Engineering Workshop, Mar. 2003.
31. A. Montresor, H. Meling, and O. Babaoglu, "Messor: Load-balancing through a swarm of autonomous agents," in Int. Workshop on Agents and Peer-to-Peer Computing, Jul. 2002.
32. M. Naor and U. Wieder, "Novel architectures for P2P applications: The continuous-discrete approach," in ACM SPAA, Jun. 2003, pp. 50-59.
33. B. Rais, P. Jacquet, and W. Szpankowski, "Limiting distribution for the depth in patricia tries," SIAM J. Discrete Math., vol. 6, no. 2, pp. 197-213, May 1993.
34. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in ACM SIGCOMM, Aug. 2001, pp. 161-172.
35. M. Roussopoulos and M. Baker, "Practical load balancing for content requests in peer-to-peer networks," Distrib. Comput., vol. 18, no. 6, pp. 421-434, Jun. 2006.
36. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in IFIP/ACM Int. Conf. Distributed Systems Platforms, Nov. 2001, pp. 329-350.
37. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balarkishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in ACM SIGCOMM, Aug. 2001, pp. 149-160.
38. B. Vocking, "How asymmetry helps load balancing," in IEEE Symp. Foundations of Computer Science, Oct. 1999, pp. 131-141.
39. X. Wang, Y. Zhang, X. Li, and D. Loguinov, "On zone-balancing of peer-to-peer networks: Analysis of random node join," in ACM SIGMETRICS, Jun. 2004, pp. 211-222.
40. J. Xu, A. Kumar, and X. Yu, "On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks," IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 151-163, Jan. 2004.
41. B. Y. Zhao, J. D. Kubiatowicz, and A. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing Univ. California, Berkeley, Tech. Rep., 2001.
42. Y. Zhu and Y. Hu, "Efficient, proximity-aware load balancing for DHT-based P2P systems," IEEE Trans Parallel Distrib. Syst., vol. 16, no. 4, pp. 349-361, Apr. 2005.
43. S. Q. Zhuang, B. Y. Zhao, and A. D. Joseph, "Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination," in ACM NOSSDAV, Jun. 2001, pp. 11-20.