Search and replication in unstructured peer-to-peer networks

Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker

Research output: Contribution to conferencePaperpeer-review

1330 Scopus citations


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.

Original languageEnglish (US)
Number of pages12
StatePublished - 2002
EventConference Proceedings of the 2002 International Conference on Supercomputing - New York, NY, United States
Duration: Jun 22 2002Jun 26 2002


OtherConference Proceedings of the 2002 International Conference on Supercomputing
Country/TerritoryUnited States
CityNew York, NY

All Science Journal Classification (ASJC) codes

  • General Computer Science


  • Peer-to-peer
  • Replication
  • Search
  • Unstructured


Dive into the research topics of 'Search and replication in unstructured peer-to-peer networks'. Together they form a unique fingerprint.

Cite this