On the connectedness of peer-to-peer overlay networks

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2005, Pages 474-480

  Si, Weisheng ^a   Li, Mingchu ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTEDNESS; CONTENT QUERIES; OVERLAY NETWORKS; PEER-TO-PEER (P2P);

APPROXIMATION THEORY; GRAPHIC METHODS; PROBABILITY; QUERY LANGUAGES; TELECOMMUNICATION NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 23944447619     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2005.206     Document Type: Conference Paper

References (12)

1. Y. CHAWATHE, S. RAINASAMY, L. BRESLAU, N. LANHAM, and S. SHENKER. Making Gnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003, pages 407-418, Aug. 2003.
2. T. I. Fenner and A. M. Frieze. On the connectivity of random m-orientable graphs and digraphs. Combinatorica, 2:347-359, 1982.
3. Gnutella. Gnutella project. http://www.gnutella.com.
4. S. Janson, T. Luczak, and A. Rucinski. Random Graphs. John Wiley and Sons, INC., 2000.
5. L. Katz. Probability of indecomposability of a random mapping function. Annals Of Mathematical Statistics, 25:512-517, 1955.
6. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In Proceedings of ACM SIGCOMM 2003, pages 395-406, Aug. 2003.
7. S. Networks. Kazaa. http://www.kazaa.com/.
8. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM 2001, San Diego, pages 149-160, Aug. 2001.
9. A. Rowstron and P. Druschel. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov. 2001.
10. S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking, 2002., Jan. 2002.
11. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of ACM SIGCOMM 2001, San Diego, pages 160-172, Aug. 2001.
12. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report UCB/CSD-01-1141, University of California, Berkeley, April 2001.