Search and replication in unstructured peer-to-peer networks
Top Cited Papers
- 22 June 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
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 individual query generates a large amount of traffic and large systems quickly become overwhelmed by the query-induced load. This paper explores various alternatives to Gnutella's query algorithm and data replication strategy. 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 a distributed replication strategy that yields close-to-optimal performance.Keywords
This publication has 7 references indexed in Scilit:
- Replication strategies in unstructured peer-to-peer networksPublished by Association for Computing Machinery (ACM) ,2002
- Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utilityPublished by Association for Computing Machinery (ACM) ,2001
- Search in power-law networksPhysical Review E, 2001
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- ChordPublished by Association for Computing Machinery (ACM) ,2001
- Free riding on GnutellaFirst Monday, 2000
- A random graph model for massive graphsPublished by Association for Computing Machinery (ACM) ,2000