Random walks in peer-to-peer networks

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 120-130

  Gkantsidis, Christos ^a   Mihail, Milena ^a   Saberi, Amin ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Graph Theory; Peer to Peer networks; Random Walks; Statistics

Indexed keywords

OVERLAY TOPOLOGY; PEER-TO-PEER NETWORKS; RANDOM WALKS; STATISTICAL PROPERTIES;

ALGORITHMS; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; STATISTICAL METHODS; TOPOLOGY;

COMPUTER NETWORKS;

EID: 8344250202     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in International Conference on Supercomputing (ICS'02). ACM, 2002.
2. Ching Law and Kai-Yeung Siu, "Distributed construction of random expander networks," in Proc. Infocom. IEEE, 2003.
3. M. Ajtai, J. Komlos, and E. Szemeredi, "Deterministic simulation in logspace," Proc. 19th ACM Symp. on Theory of Computing (STOC), 1987.
4. D. Aldous, "On the markov chain simulation method for uniform combinatorial distributions and simulated annealing," Probab. Engrg. Inform. Sci., 1, pp 33-46, 1987.
5. R. Impagliazzo and D. Zuckerman, "How to recycle random bits," Proc. 30th IEEE Symp. on Foundations of Computer Science (FOCS), 1989.
6. D. Gillman, "A chernoff bound for random walks on expander graphs," Proc. 34th IEEE Symp. on Foundations of Computer Science (FOCS93), vol. SIAM J. Comp., Vol 27, No 4, 1998.
7. O. Gabber and Z. Galil, "Explicit constructions of linear-sized superconcentrators," Journal of Computer and System Sciences, vol. 22, pp. 407-420, 1981.
8. William Feller, An Introduction to Probability Theory and Its Applications, vol. I, John Willey & Sons, 3rd edition, 1968.
9. N. Alon and J. Spencer, The Probabilistic Method, John Wiley & Sons, 2000.
10. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford Science Publications, 1965.
11. G.H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1989.
12. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach, Springer-Verlag, 1997.
13. A. Broder and A. Karlin, "Bounds on the cover time," J. Theoretical Probab., 2:101-120, 1989.
14. D. Aldous and J. Fill, "Reversible markov chains and random walks on graphs," Monograph, http://stat-www.berkeley.edu/users/aldous/book.html, 2002.
15. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomikns, and J. Wiener, "Graph structure in the web," 9th International World Wide Web Conference (WWW9)/Computer Networks, vol. 33, no. 1-6, pp. 309-320, 2000.
16. S. Dill, R. Kumar, K. McCurley, S. Rajagopolan, D. Sivakumar, and A. Tomkins, "Self-similarity in the web," in International Conference on Very Large Data Bases, Rome, 2001, pp. 69-78.
17. Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal, "Building low-diameter p2p networks," in IEEE Symposium on Foundations of Computer Science, 2001, pp. 492-199.
18. C. Gkantsidis, M. Mihail, and A. Saberi, "Conductance and congestion in power law graphs," in Proc. SigMetrics. ACM, 2003.
19. Fan Chung, Lincoln Lu, and Van Vu, "The spectra of random graphs with given expected degrees," Proceedings of National Academy of Sciences, vol. 100, no. 11, pp. 6313-6318, 2003.
20. M. Mihail, C.H. Papadimitriou, and A. Saberi, "On certain connectivity properties of internet graphs," FOCS, 2003, to appear.
21. Andy Oram, Ed., Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O'Reilly, first edition, 2001.
22. David Gibson, Jon M. Kleinberg, and Prabhakar Raghavan, "Inferring web communities from link topology," UK Conference on Hypertext, 1998.
23. C. Gkantsidis, M. Mihail, and E. Zegura, "Spectral analysis of internet topologies," in Proc. Infocom. IEEE, 2003.
24. R. Kumar, S. Rajagopalan, D. Sivakumar, and A. Tomkins, "Crawling the web for emerging cyber-communities," in WWW8/Computer Networks, 1999, vol. 31, pp. 1481-1493.
25. Tian Bu and Don Towsley, "On distinguishing between internet power law topology generators," in Proc. Infocom. IEEE, 2002.
26. N. Leibowitz, M. Ripeanu, and A. Wierzbicki, "Deconstructing the kazaa network," in Proc. WIAPP. IEEE, June 2003, pp. 112-120.
27. Limewire.org, "Snapshots of the gnutella network," http://crawler.limewire.org/data.html, 2002.
28. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationhips of the internet topology," in Proc. SigComm. ACM, 1999.
29. M. Jovanovic, F. Annexstein, and K. Berman, "Modeling peer-to-peer network topologies through small-world models and power laws," in IX Telecommunications Forum, 2001, http://www.ececs.uc.edu/~mjovanov/Research/ telfor.pdf.
30. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making gnutella-like p2p systems scalable," in Proc. SIGCOMM. ACM, 2003, to appear.
31. Albert-László Barabasi and Réka Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.