Ad-hoc limited scale-free models for unstructured peer-to-peer networks

Proceedings - P2P'08, 8th International Conference on Peer-to-Peer Computing

Volumn , Issue , 2008, Pages 160-169

  Guclu, Hasan ^a   Kumari, Durgesh ^b   Yuksel, Murat ^b  

^a CENTER FOR NONLINEAR STUDIES   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUTOFF VALUES; GLOBAL TOPOLOGIES; P2P SEARCHES; PEER-TO-PEER NETWORKS; PRACTICAL SOLUTIONS; PROTOCOL STACKS; REACH ABILITIES; SCALE-FREE; SEVERAL PROTOCOLS;

COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

AD HOC NETWORKS;

EID: 55249103447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2008.16     Document Type: Conference Paper

References (43)

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. R. Albert and A.-L. Barabási. Topology of evolving networks: local events and universality. Physical Review Letters, 85:5234, 2000.
5. R. Albert, H. Jeong, and A.-L. Barabási. Diameter of the Worldwide Web. Nature, 401:130, 1999.
6. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks. Nature, 406:378, 2000.
7. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks (correction). Nature, 409:542, 2000.
8. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509, 1999.
9. A.-L. Barabási, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek. Evolution of the social network of scientific collaborations. Physica A, 311:590, 2002.
10. M. Boguná, R. Pastor-Satorras, and A. Vespignani. Cut-offs and finite size effects in scale free networks. The European Physical Journal B, 38:205, 2004.
11. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making Gnutella-like systems scalable. In Proceedings of ACM SIGCOMM, 2003.
12. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer-to-peer networks: Harnessing latent semantics. In Proceedings of Conference on Computer Communications (INFOCOM), 2003.
13. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In Proceedings of ACM SIGCOMM, 2002.
14. R. Cohen and S. Havlin. Scale-free networks are ultrasmall. Physical Review Letters, 90:058701, 2003.
15. S. Dorogovtsev and J. Mendes. Scaling behavior of developing and decaying networks. Europhysics Letters, 52:33-39, 2000.
16. S. Dorogovtsev and J. Mendes. Evolution of networks. Advances in Physics, 51:1079, 2002.
17. S. Dorogovtsev, J. Mendes, and A. Samukhin. Anomalous percolation properties of growing networks. Physical Review E, 64:066110, 2001.
18. J. C. Doyle, D. L. Alderson, L. Li, S. Low, M. Roughan, S. Shalunov, R. Tanaka, and W. Willinger. The 'robust yet fragile' nature of the Internet. Proceedings of the National Academy of Sciences, 102:14497, 2005.
19. H. Ebel, M.-I. Mielsch, and S. Bornholdt. Scale-free topology of e-mail networks. Physical Review E, 66:035103(R), 2002.
20. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. ACM Computer Communication Review, 29:251, 1999.
21. P. Garbacki, D. H. J. Epema, and M. van Steen. Optimizing peer relationships in a super-peer network. In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
22. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of Conference on Computer Communications (INFOCOM), 2003.
23. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In Proceedings of Conference on Computer Communications (INFOCOM), 2005.
24. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. 2nd Ed., Reading, MA: Addison-Wesley, 1994.
25. H. Guclu. Synchronization Landscapes in Small-World-Connected Computer Networks. PhD thesis, Rensselaer Polytechnic Institute, 2005. arXiv:cond-mat/0601278.
26. H. Guclu, G. Korniss, , and Z. Toroczkai. Extreme fluctuations in noisy task-completion landscapes on scale-free networks. Chaos, 17:026104, 2007.
27. H. Guclu and M. Yuksel. Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks. In Proceedings of IEEE ICDCS, 2007.
28. K. Hui, J. Lui, and D. Yau. Small-world overlay p2p networks: Constructing and handling of dynamic flash crowd. Computer Networks, 50:2727-2746, 2006.
29. A. Iamnitchi, M. Ripeanu, and I. Foster. Small-world file-sharing communities. In Proceedings of Conference on Computer Communications (INFOCOM), 2004.
30. J. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
31. G. Korniss. Synchronization in weighted uncorrelated complex networks in a noisy environment: Optimization and connections with transport efficiency. Physical Review E, 75:051121, 2007.
32. P. Krapivsky and S. Redner. Organization of growing random networks. Physical Review E, 63:066123, 2001.
33. P. Krapivsky and S. Redner. A statistical physics perspective on web growth. Computer Networks, 39:261-276, 2002.
34. A. Kumar, J. Xu, and E. W. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In Proceedings of Conference on Computer Communications (INFOCOM), 2005.
35. S. Merugu, S. Srinivasan, and E. Zegura. Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. Journal of Parallel and Distributed Computing, 65:142-153, 2005.
36. N. Sarshar and V. Roychowdhury. Scale-free and stable structures in complex ad hoc networks. Physical Review E, 69:026101, 2004.
37. K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In Proceedings of Conference on Computer Communications (INFOCOM), 2003.
38. I. Stoica, R. Morris, D. Karger, H. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, 2001.
39. Z. Toroczkai and K. Bassler. Jamming is limited in scale-free systems. Nature, 428:716, 2004.
40. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440, 1998.
41. J. Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In Proceedings of Conference on Computer Communications (INFOCOM), 2003.
42. Z. Yao, X. Wang, D. Leonard, and D. Loguinov. On node isolation under churn in unstructured p2p networks with heavy-tailed lifetimes. In Proceedings of IEEE International Conference on Computer Communication, 2007.
43. H. Zhang, A. Goel, and R. Govindan. Using the small-world model improve Freenet performance. In Proceedings of Conference on Computer Communications (INFOCOM), 2002.