Qin Lv
Edith Cohen
Scott Shenker
ABSTRACT
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. However, the flooding-based query algorithm used in Gnutella does not scale; each query generates a large amount of traffic and large systems quickly become overwhelmed by the query-induced load. This paper explores, through simulation, various alternatives to Gnutella's query algorithm, data replication strategy, and network topology. We propose a query algorithm based on multiple random walks that resolves queries almost as quickly as Gnutella's flooding method while reducing the network traffic by two orders of magnitude in many cases. We also present simulation results on a distributed replication strategy proposed in [8]. Finally, we find that among the various network topologies we consider, uniform random graphs yield the best performance.
- L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power law networks. In Phys. Rev. E64, pages 46135--46143, 2001.Google Scholar
Cross Ref
- E. Adar and B. A. Huberman. Free riding on gnutella. In First Monday, http://www.firstmonday.dk/issues/ issue5_10/adar/index.html, Oct. 2000.Google Scholar
- W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proceedings of STOC'00, pages 171--180, 2000. Google ScholarDigital Library
- V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing reference locality in the www. In Proceedings of 1996 International Conference on parallel and Distributed Information Systems (PDIS '96), Dec. 1996. Google ScholarDigital Library
- K. Calvert and E. W. Zegura. Gt-itm: Georgia tech internetwork topology models. In http://www.cc.gatech.edu/projects/gtitm/, 1997.Google Scholar
- Clip2.com. The gnutella protocol specification v0.4. In http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf, 2000.Google Scholar
- Clip2.com. Gnutella: To the bandwidth barrier and beyond. In http://www.clip2.com/gnutella.html, 2000.Google Scholar
- E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In Proceedings of ACM SIGCOMM'02, Aug. 2002. Google ScholarDigital Library
- A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), July 2002. Google ScholarDigital Library
- Free Haven website. http://www.freehaven.net.Google Scholar
- Freenet website. http://freenet.sourceforge.net.Google Scholar
- D. Gallagher and R. Wilkerson. Network performance statistics for university of south carolina. In http://eddie.csd.sc.edu, Oct. 2001.Google Scholar
- Gnutella website. http://gnutella.wego.com.Google Scholar
- M. A. Jovanovic, F. S. Annexstein, and K. A. Berman. Scalability issues in large peer-to-peer networks - a case study of gnutella. Technical Report http://www.ececs.uc.edu/~mjovanov/Research/paper.html, University of Cincinnati, 2001.Google Scholar
- Mojo Nation, 2001. http://www.mojonation.net.Google Scholar
- Napster website. http://www.napster.com.Google Scholar
- D. Plonka. Uw-madison napster traffic measurement. In http://net.doit.wisc.edu/data/Napster, Mar. 2000.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM'01, Aug. 2001. Google ScholarDigital Library
- J. Ritter. Why gnutella can't scale. no, really. In http://www.darkridge.com/~jpr5/doc/ gnutella.html, 2001.Google Scholar
- A. Rowstron and P. Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proceedings of SOSP'01, 2001. Google ScholarDigital Library
- K. Sripanidkulchai. The popularity of gnutella queries and its implications on scalability. In O'Reilly's www.openp2p.com, Feb. 2001.Google Scholar
- S. D. G. Stefan~Saroiu, P. Krishna Gummadi. A measurement study of peer-to-peer file sharing systems. Technical Report UW-CSE-01-06-02, Department of Computer Science & Engineering, University of Washington, 2002.Google Scholar
- I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM'01, Aug. 2001. Google ScholarDigital Library
- K. Truelove. Gnutella: Alive, well, and changing fast. In http://www.openp2p.com/pub/a/p2p/2001/01/25/ truelove0101.html, Jan. 2001.Google Scholar
- B. Yang and H. Garcia-Molina. Efficient search in peer-to-peer networks. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), July 2002. Google ScholarDigital Library
- 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 at Berkeley, Computer Science Department, 2001. Google ScholarDigital Library
Index Terms
- Search and replication in unstructured peer-to-peer networks
Recommendations
Search and replication in unstructured peer-to-peer networks
ACM International Conference on Supercomputing 25th Anniversary VolumeDecentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. However, the flooding-based ...
Analysis of search and replication in unstructured peer-to-peer networks
SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systemsThis paper investigates the effect of the number of file replicas on search performance in unstructured peer-to-peer networks. We observe that for a search network with a random graph topology where file replicas are uniformly distributed, the hop ...
Analysis of TTL-Based Consistency in Unstructured Peer-to-Peer Networks
Consistency maintenance is important to the sharing of dynamic contents in peer-to-peer (P2P) networks. The TTL-based mechanism is a natural choice for maintaining freshness in P2P content sharing. This paper investigates TTL-based consistency ...
Comments