On zone-balancing of peer-to-peer networks: Analysis of random node join

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 211-222

  Wang, Xiaoming ^a   Zhang, Yueping ^a   Li, Xiafeng ^a   Loguinov, Dmitri ^a  

^a Texas AandM University   (United States)

Author keywords

Balls into Bins; Load Balancing; Modeling; Peer to Peer

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; ROUTERS; SAMPLING;

BALLS-INTO-BLUE; LOAD BALANCING; MODELING; PEER-TO-PEER;

PACKET NETWORKS;

EID: 8344220592     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005713     Document Type: Conference Paper

References (45)

1. K. Aberer, A. Datta, and M. Hauswirth, "The Quest for Balancing Peer Load in Structured Peer-to-Peer Systems," EPFL Technical Report, 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," ACM STOC, June 2003.
3. J. Aspnes, Z. Diamadi, and G. Shah, "Fault-Tolerant Routing in Peer-to-Peer Systems," ACM PODC, July 2002.
4. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced Allocations," SIAM Journal on Computing, vol. 29, July 1999.
5. A. Barabasi, R. Albert, and H. Jeong, "Mean-Field Theory for Scale-Free Random Networks," Physica A 272, 1999.
6. J. Byers, J. Considine, and M. Mitzenmacher, "Geometric Generalizations of the Power of Two Choices," BU Technical Report, February 2003.
7. J. Byers, J. Considine, and M. Mitzenmacher, "Simple Load Balancing for Distributed Hash Tables," IPTPS, February 2003.
8. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-like P2P Systems Scalable," ACM SIGCOMM, August 2003.
9. R.M. Corless, G.H. Gonnet, D.E.G. Hare, D.J. Jeffrey, and D.E. Knuth, "On the Lambert W Function," Advances in Computational Mathematics, vol. 5, 1996.
10. D.A. Darling, "On a Class of Problems Related to the Random Division of an Interval," Annals of Math. Statistics, vol. 24, June 1953.
11. M.H. DeGroot, Probability and Statistics. Addison-Wesley, 2001.
12. L. Devroye, "Law of the Iterated Logarithm for Order Statistics of Uniform Spacings," Annals of Probability, vol. 9, no. 5, 1981.
13. L. Devroye, "A Log-Log Law for Maximal Uniform Spacings," Annals of Probability, vol. 10, no. 35, 1982.
14. S.N. Dorogotsev and J. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, 2003.
15. P. Fraigniaud and P. Gauron, "The Content-Addressable Network D2B," Technical Report 1349, 2003.
16. P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, March 2000.
17. F. Kaashoek and D. Karger, "Koorde: A Simple Degree-optimal Hash Table," IPTPS, February 2003.
18. 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," ACM STOC, May 1997.
19. D. Karger and M. Ruhl, "New Algorithms for Load Balancing in Peer-to-Peer Systems," IRIS Student Workshop, August 2003.
20. R.M. Karp, M. Luby, and F. Meyer auf der Heide, "Efficient PRAM Simulation on a Distributed Memory Machine," ACM STOC, May 1992.
21. C. Knessl and W. Szpankowski, "Limit Laws for Heights in Generalized Tries and Patricia Tries," LATIN, 2000.
22. T.G. Kurtz, "Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes," Journal of Applied Probability, vol. 7, 1970.
23. C. Law and K.-Y. Siu, "Distributed Construction of Random Expander Graphs," IEEE INFOCOM, March 2003.
24. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of Peer-to-Peer Networks," ACM PODC, July 2002.
25. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience," ACM SIGCOMM, August 2003.
26. W. Magnus, F. Oberhettinger, and R.P. Soni, Formulas and Theorems for the Special Functions of Mathematical Physics. Springer-Verlag, 1966.
27. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly," ACM PODC, July 2002.
28. M. Mitzenmacher, "Load Balancing and Density Dependent Jump Markov Processes," IEEE FOCS, October 1996.
29. M. Mitzenmacher, "Studying Balanced Allocations with Differential Equations," Combinatorics, Probability, and Computing, vol. 8, 1999.
30. M. Mitzenmacher, "The Power of Two Choices in Randomized Load Balancing," Ph.D. thesis, 1996.
31. A. Mondal, K. Goda, and M. Kitsuregawa, "Effective Load-Balancing of Peer-to-peer systems," Data Engineering Workshop, March 2003.
32. A. Montresor, H. Meling, and O. Babaoglu, "Messor: Load-Balancing through a Swarm of Autonomous Agents," International Workshop on Agents and Peer-to-Peer Computing, 2002.
33. M. Naor and U. Wieder, "Novel Architectures for P2P Applications: the Continuous-Discrete Approach," ACM SPAA, June 2003.
34. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load Balancing in Structured P2P Systems," IPTPS, February 2003.
35. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," ACM SIGCOMM, August 2001.
36. M. Roussopoulos and M. Baker, "Practical Load Balancing for Content Requests in Peer-to-Peer Networks," Stanford University Technical Report, January 2003.
37. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," IFIP/ACM International Conference on Distributed Systems Platforms, November 2001.
38. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balarkishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," ACM SIGCOMM, August 2001.
39. W. Szpankowski, "Patricia Trees Revisited Again," Journal of the ACM, vol. 37, 1990.
40. B. Vocking, "How Asymmetry Helps Load Balancing," IEEE Symposium on Foundations of Computer Science, 1999.
41. X. Wang, Y. Zhang, X. Li, and D. Loguinov, "On Zone-Balancing of Peer-to-Peer Networks: Analysis of Random Node Join (extended version)," Texas A&M Technical Report, June 2004.
42. J. Xu, A. Kumar, and X. Yu, "On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks," IEEE JSAC, vol. 22, no. 1, January 2004.
43. B.Y. Zhao, J.D. Kubiatowicz, and A. Joseph, "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing," UC Berkeley Technical Report, April 2001.
44. Y. Zhu and Y. Hu, "Efficient, Proximity-Aware Load Balancing for Structured Peer-to-Peer Systems," International Conference on Peer-to-Peer Computing, September 2003.
45. S.Q. Zhuang, B.Y. Zhao, and A.D. Joseph, "Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination," ACM NOSSDAV, June 2001.