Analyzing kleinberg's (and other) small-world models

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 179-188

  Martel, Chip ^a   Van Nguyen, ^a  

^a University of California   (United States)

Author keywords

Diameter; Random graphs; Routing; Small world network

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; ROUTERS;

DISCRETE MATHEMATICS; RANDOM GRAPHS; SMALL-WORLD MODELS;

NETWORK PROTOCOLS;

EID: 10444257160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011794     Document Type: Conference Paper

References (25)

1. R. Albert, H. Jeong, A.-L. Barabasi, "The diameter of the World Wide Web" Nature 401, 130 (1999).
2. J. Aspnes, Z. Diamadi, G. Shah, "Fault-tolerant Routing in Peer-to-peer Systems", Proc. 22nd ACM Symp. on Princ. of Dist. Computing, 2002, p. 223-232
3. L. Barriere, P. Fraigniaud, E. Kranakis, D. Krizanc, "Efficient Routing in Networks with Long Range Contacts", Proc. 15th Intr. Symp. on Dist. Computing, DISC 01, 2001, p. 270-284
4. I. Benjamini and N. Berger, "The Diameter of a Long-Range Percolation Clusters on Finite Cycles" Random Structures and Algorithms, 19, 2:102-111 (2001).
5. B. Bollobas, "The Diameter of Random Graphs", IEEE Trans. Inform. Theory 36 (1990), no. 2, 285-288.
6. B. Bollobas, F.R.K. Chung, "The diameter of a cycle plus a random matching", SIAM J. Discrete Math. 1,328 (1988)
7. B. Bollobas, Random Graphs (Academic Press, London, 1985)
8. F. Chung and L. Lu, "The Diameter of Random Sparse Graphs", Advances in Applied Math. 26 (2001), 257-279.
9. D. Coppersmith, D. Gamarnik, and M. Sviridenko "The diameter of a long- range percolation graph", Random Structures and Algorithms, 21, 1:1-13 (2002).
10. P. Dodds, R. Muhamad, and D. Watts, "An experimental study of search in global social networks", Science, 301:827-829, 2003.
11. D. Kemper, J. Kleinberg, and A. Demers, "Spatial gossip and resource location protocols", in Proc. ACM Symp. Theory of Computing, 163-172, 2001.
12. P. Fraigniaud, C. Gavoille and Christophe Paul, "Eclecticism Shrinks the World", Technical Report LRI-1376, University Paris-Sud, Nov. 2003. Also, to appear in PODC 2004.
13. J. Kleinberg, "Small-World Phenomena and the Dynamics of Information", in Advances in Neural Information Processing Systems (NIPS) 14, 2001.
14. J. Kleinberg, "The Small-World Phenomenon: An Algorithmic Perspective", in Proc. 32nd ACM Symp. Theory of Computing, 163-170, 2000.
15. M. Kochen, Ed., The Small-World (Ablex, Norwood, 1989)
16. E. Lebhar and N. Schabanel, "Almost optimal decentralized routing in long-range contact networks", to appear in ICALP 2004, 2004.
17. G. S. Manku and M. Naor and U. Wieder, "Know Thy Neighbour's Neighbour: The Role of Lookahead in Randomized P2P Networks", Proc. 36th ACM Symposium on Theory of Computing (STOC 2004).
18. G. Manku, "Routing Networks for Distributed Hash Tables", Proc. 22nd ACM Symposium on Principles of Distributed Computing, PODC 2003, p. 133-142, June 2003
19. Charles Martel and Van Nguyen, "The complexity of message delivery in Kleinberg's Small-world Model", Tech-Report CSE-2003-23, CS-UCDavis, 2003.
20. D. Malkhi, M. Naor, D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly", Proc. of the 21st ACM Symposium on Principles of Distributed Computing, 2002
21. S. Milgram, "The small world problem" Psychology Today 1,61 (1967).
22. D. Watts and S. Strogatz, "Collective Dynamics of small-world networks" Nature 393,440 (1998).
23. Xu, J., Kumar, A., and Yu, X., "On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks", accepted to IEEE Journal on Selected Areas in Communications
24. S. Yook, H. Jeong, A.-L. Barabasi, "Modeling the Internet's large-scale topology", Proceedings of the National Academy of Sciences, 99:13382-13386, 2002.
25. H. Zhang, A. Goel and R. Gividan, "Using the Small-World Model to Improve Freenet Performance" Proc. IEEE Infocom, 2002.