Non-uniform random membership management in peer-to-peer networks

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 1151-1161

  Zhong, Ming ^a   Shen, Kai ^a   Seiferas, Joel ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK TOPOLOGIES; PEER-TO-PEER NETWORKS; RANDOM MEMBERSHIP SUBSET; RANDOM SUBSETS;

ALGORITHMS; INFORMATION ANALYSIS; SET THEORY; TOPOLOGY;

NETWORKS (CIRCUITS);

EID: 25844500356     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498342     Document Type: Conference Paper

References (31)

1. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, "Randomized Rumor Spreading," in Proc. of the 41st IEEE Sympo. on Foundations of Computer Science, Redondo Beach, CA, Nov. 2000, pp. 565-574.
2. B. Pittel, "On Spreading A Rumor," SIAM J. Applied Math., vol. 47, no. 1, pp. 213-223, Feb. 1987.
3. G. S. Manku, "Routing Networks for Distributed Hash Tables," in Proc. of the 22nd ACM Sympo. on Principles of Distributed Computing, June 2003, pp. 133-142.
4. G. S. Manku, M. Bawa, and P. Raghavan, "Symphony: Distributed Hashing in A Small World " in Proc. of the 4th USENIX Sympo. on Internet Technologies and Systems, Seattle, WA. Mar. 2003.
5. D. Karger and M. Ruhl, "Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems," in Proc. of ACM SPAA, Barcelona, Spain, June 2004. pp. 36-43.
6. D. Kostić, A. Rodriguez, J. Albrecht, A. Bhirud, and A. Vahdat, "Using Random Subsets to Build Scalable Network Services," in Proc. of the 4th USENIX Sympo. on Internet Technologies and Systems, Seattle, WA, Mar. 2003.
7. K. Shen, "Structure Management for Scalable Overlay Service Construction," in Proc. of the First USENIX/ACM Sympo. on Networked Systems Design and Implementation, San Francisco, CA, Mar. 2004, pp. 281-294.
8. P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec, "Lightweight Probabilistic Broadcast," ACM Trans. on Computer Systems, vol. 21, no. 4, pp. 341-374, Nov. 2003.
9. A. J. Ganesh, A. Kermarrec, and L. Massoulié, "SCAMP: Peer-to-peer Lightweight Membership Service for Large-scale Group Communication," in Proc. of the 3rd International Workshop on Networked Group Communicatio, London, UK, Nov. 2001, pp. 44-55.
10. D. Kempe, J. Kleinberg, and Alan Demers, "Spatial Gossip and Resource Location Protocols," in Proc. of the 33rd ACM symposium on Theory of computing. Hersonissos, Greece, 2001, pp. 163-172.
11. J. Kleinberg, "The Small-world Phenomenon: An Algorithm Perspective," in Proc. of the 32nd ACM symposium on Theory of computing, Portland, OR, 2000, pp. 163-170.
12. S. Tilak, A. Murphy, and W. Heinzelman, "Non-Uniform Information Dissemination for Sensor Networks," in Proc. of the 11th IEEE International Conference on Network Protocols, Atlanta, GA, Nov. 2003, pp. 295-304.
13. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, "Equation of State Calculations by Fast Computing Machines," J. Chem. Phys., vol. 21. pp. 1087-1092, 1953.
14. Y. Azar, A. Broder, A. Karlin, N. Linial, and S. Phillips, "Biased Random Walks," in Proc. of the 24th ACM Sympo. on the Theory of Computing, 1992, pp. 1-9.
15. I. Stoica, R. Morris, D. Karger, M. Frans Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," in Proc. of the ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 149-160.
16. V. King and J. Saia, "Choosing A Random Peer," in Proc. of the 23rd ACM Sympo. on Principles of Distributed Computing, 2004, pp. 125-130.
17. W. Doeblin, "Exposé de la théorie des chaînes simples constantes de Markov á un nombre fini d'états," Mathematique de l'Union Interbalkanique, vol. 2, pp. 77-105, 1938.
18. P. Diaconis and D. Stroock, "Geometric Bounds for Eigenvalues of Markov Chains," Annals of Applied Probability, vol. 1. pp. 36-61, 1991.
19. A. Sinclair, "Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow," Combinatorics, Probability and Computing, vol. 1, pp. 351-370, 1992.
20. A. Sinclair and M. Jerrum, "Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains," Information and Comput., vol. 82. pp. 93-133, 1989.
21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proc. of the ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 161-172.
22. "Gnutella," http://www.gnutella.com.
23. I. Clarke, T. Hong, S. Miller, O. Sandberg, and B. Wiley. "Protecting Free Expression Online with Freenet," IEEE Internet Computing, vol. 6, no. 1, pp. 40-49, 2002.
24. C. Law and K. Siu, "Distributed Construction of Random Expander Networks," in Proc. of the IEEE INFOCOM, San Francisco, CA, Mar. 2003.
25. M. Jovanović, F. Annexstein, and K. Berman, "Modeling Peer-to-peer Network Topologies Through Small-world Models and Power Laws," in IX Telecommunications Forum, 2001.
26. T. S. Eugene Ng and H. Zhang, "Predicting Internet Network Distance with Coordinates-based Approaches," in Proc. of the IEEE INFOCOM, New York, NY, June 2002.
27. B. Bollobás, Random Graphs, Academic Press. London. UK, 1985.
28. C. Gkantsidis, M. Mihail, and A. Saberi, "Conductance and Congestion in Power Law Graphs," in Proc. of ACM SIGMETRICS, San Diego, CA, June 2003, pp. 148-159.
29. B. Bollobás and O. Riordan, "The Diameter of a Scale-free Random Graph," Combinatorica, vol. 24, no. 1, pp. 5-34, 2004.
30. A. Barabási and R. Albert, "Emergence of Scaling in Random Networks," Science, vol. 286, pp. 509-512, 1999.
31. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnady, "The Degree Sequence of a Scale-free Random Graph Process," Random Structures and Algorithms, vol. 18, no. 3, pp. 279-290, 2001.