Percolation search in power law networks: Making unstructured peer-to-peer networks scalable

Proceedings - 4th International Conference on Peer-to-Peer Computing, P2P2004

Volumn , Issue , 2004, Pages 2-9

  Sarshar, Nima ^a   Boykin, P Oscar ^a   Roychowdhury, Vwani P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SEARCHES; PEER-TO-PEER NETWORKS; SEARCHING PROTOCOLS; UNSTRUCTURED NETWORKS;

ALGORITHMS; COMPUTER SOFTWARE; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; ONLINE SEARCHING; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

COMPUTER NETWORKS;

EID: 13244279546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PTP.2004.1334925     Document Type: Conference Paper

References (19)

1. How peer-to-peer (p2p) and kazaa media desktop work, Kazaa Website:http://www.kazaa.com/us/help/guide-aboutp2p.htm, 2003.
2. homepage, http://www.morpheus.com/index.html, 2004.
3. homepage, http://www.imesh.com/, 2004.
4. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman, Search in power-law networks, Phys. Rev. E 64 (2001), 046135.
5. William Aiello, Fan Chung, and Linyuan Lu, A random graph model for massive graphs, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM Press, 2000, pp. 171-180.
6. _, Random evolution in massive graphs, IEEE Symposium on Foundations of Computer Science, 2001.
7. P. Druschel and A. Rowstron, PAST: A large-scale, persistent peer-to-peer storage utility, Proceedings of the Eigth IEEE Workshop on Hot Topics in Operating Systems (HotOS) (Schoss Elmau, germany), May 2001.
8. T. Klingberg and R. Manfredi, Rfc-gnutella, http://rfc-gnutella.sourceforge.net.
9. Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker, Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th international conference on Supercomputing, ACM Press, 2002, pp. 84-95.
10. Dahlia Malkhi, Moni Naor, and David Ratajczak, Viceroy: a scalable and dynamic emulation of the butterfly, Proceedings of the twenty-first annual symposium on Principles of distributed computing, 2002, pp. 183-192.
11. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distributions and their applications, Phys. Rev. E 64 (2001), 026118.
12. Matei Ripeanu, Ian Foster, and Adriana Iamnitchi, Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design, IEEE Internet Computing Journal 6 (2002), no. 1.
13. Christopher Rohrs, Limewire design, lime wire documents:http://www.limewire.org/project/www/design.html, 2001.
14. A. Rowstron and P. Druschel, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP'01) (Chateau Lake Louise, Banff, Canada), October 2001.
15. S. Saroiu and S.D. Gribble P. Krishna Gummadi, A measurement study of peer-to-peer file sharing systems, Proceedings of the Multimedia Computing and Networking (MMCN), January 2002.
16. Nima Sarshar, P. Oscar Boykin, and Vwani P. Roychowdhury, Percolation at a multiple of the threshold, 2004.
17. Nima Sarshar and Vwani Roychowdhury, Scale-free and stable structures in complex ad hoc networks, Phys. Rev. E 69 (2004), no. 026101.
18. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the ACM SIGCOMM 2001 Technical Conference (San Diego, USA), August 2001.
19. Ben Y. Zhao, John D. Kubiatowicz, and Anthony D. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Report CSD-01-1141, U. C. Berkeley, Apr 2001.