Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2007, Pages

  Guclu, Hasan ^a   Yuksel, Murat ^b  

^a CENTER FOR NONLINEAR STUDIES   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCALABILITY; TOPOLOGY;

DATA ORGANIZATION; PEER-TO-PEER NETWORKS;

COMPUTER NETWORKS;

EID: 34848924328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2007.133     Document Type: Conference Paper

References (26)

1. Gnutella home page. http://www.gnutella.wego.com.
2. The Freenet Project. http://freenetproject.org.
3. The Napster home page. http://www.napster.com.
4. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman. Search in power-law networks. Physical Review E, 64:046135, 2001.
5. W. Aiello, F. Chung, and L. Lu. A random graph model for power law graphs. Experimental Mathematics, 10:53, 2001.
6. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509, 1999.
7. E. Bender and E. Canfield. The asymptotic number of labeled graphs with given degree sequences. J. Comb. Theory A, 24:296, 1978.
8. M. Boguna, R. Pastor-Satorras, and A. Vespignani. Cut-offs and finite size effects in scale free networks. The European Physical Journal B, 38:205, 2004.
9. M. Catanzaro, M. Boguna, and R. Pastor-Satorras. Generation of uncorrelated random scale-free networks. Phys. Rev. E, 71:027103, 2005.
10. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer-to-peer networks: Harnessing latent semantics. In Proc. of IEEE INFOCOM, 2003.
11. R. Cohen and S. Havlin. Scale-free networks are ultrasmall. Physical Review Letters, 90:058701, 2003.
12. S. Dorogovtsev and J. Mendes. Evolution of networks. Adv. Phys., 51:1079, 2002.
13. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proc. of IEEE INFOCOM, 2003.
14. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In Proc. of IEEE INFOCOM, 2005.
15. K. Hui, J. Lui, and D. Yau. Small-world overlay p2p networks: Construction, management and handling of dynamic flash crowds. Computer Networks, 50(15):2727-2746, 2006.
16. A. Iamnitchi, M. Ripeanu, and I. Foster. Small-world file-sharing communities. In Proc. of IEEE INFOCOM, 2004.
17. J. Kleinberg. Navigation in a small world. Nature, page 845, 2000.
18. A. Kumar, J. Xu, and E. W. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In Proc. of IEEE INFOCOM, 2005.
19. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication strategies in unstructured peer-to-peer networks. In Proc. of ACM Int. Conf on Supercomputing, 2002.
20. S. Merugu, S. Srinivasan, and E. Zegura. Adding structure to unstructured peer-to-peer networks: The use of small-world graphs. J. Parallel and Distributed Computing, pages 142-153, 2005.
21. M. Molloy and B. Reed. A critical-point for random graphs with a given degree sequence. Random Structures & Algorithms, 6:161, 1995.
22. S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for DHTs: Some open questions. In Proc. of IPTPS, 2001.
23. Q. Sun and H. Garcia-Molina. Partial lookup serrvices. In Proc. of IEEE ICDCS, 2003.
24. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440, 1998.
25. J. Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In Proc. of IEEE INFOCOM, 2003.
26. R. Zhang and Y. C. Hu. Assisted peer-to-peer search with partial indexing. In Proc. of IEEE INFOCOM, 2005.