Making gnutella-like P2P systems scalable

By Yatin Chawathe, Sylvia Ratnasamy, L. Breslau, N. Lanham, Scott Shenker. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2003

1,287 citations recorded by the source corpus.

Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella's notoriously poor scaling led some to propose distributed hash table solutions to the wide-area file search problem. Contrary to that trend, we advocate retaining Gnutella's simplicity while proposing new mechanisms that greatly improve its scalability. Building upon prior research [1, 12, 22], we propose several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems. We test our design through simulations and the results show three to five orders of magnitude improvement in total system capacity. We also report on a prototype implementation and its deployment on a testbed.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/fce35b4554a3f9060c3536162ec5c27587a324a6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

An Experimental Study of the Skype Peer-to-Peer VoIP System (2005, background): “Such networks have been the subject of recent research in [29, 28, 6, 5].”
Rarest first and choke algorithms are enough (2006, background): “Whereas content localization has attracted considerable research interest in the last years [7,12,23,25], content replication has started to be the subject of active research only recently.”
A survey and comparison of peer-to-peer overlay network schemes (2005, methodology): “Gnutella is widely used and there has been a large amount of work on improving Gnutella [71]–[73].”
A peer-to-peer architecture for media streaming (2004, background): “Peer-to-peer (P2P) computing has been of interest for quite long; for instance, numerous file-sharing systems based on its concepts have been developed [1], [2], [3], [4], [5], [6].”
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior (2011, background): “Numerous researchers in widely disparate areas frequently encounter knee detection problems similar to those we describe [1], [2], [3], [4], [5].”
Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “They argued that ''the real barriers to Napster-like designs are not technical but legal and financial'' [61].”
OverSim: A Flexible Overlay Network Simulation Framework (2007, background): “Most of them are structured peer-to-peer protocols like Chord [9], Kademlia [5], Koorde [4], and Broose [12], but unstructured peer-to-peer protocols like GIA [13] are available as well.”
' s personal copy T-MAN : Gossip-based fast overlay topology construction q (2009, background): “…decentralized search applications benefit from special overlay network structures such as random or scale-free graphs[3] [4], super-peer networks [5], networks that are organized based on proximity and/or capacity of the nodes [6] [7], or distributed hash tables (DHT-s), for example, [8] [9].”
Caching in information centric networking: A survey (2013, background): “This approach has received extensive research in the distributed cache and P2P cache systems [48,58,13,40,64], but has only recently received attention in the ICN field [67,37].”
Random walks in peer-to-peer networks (2004, methodology): “methods depends on parameters not studied in this work; some of them are discussed in [30].”
Can ISPS and P2P users cooperate for improved performance? (2007, background): “The research community has explored various aspects of P2P networks, from how to design structured P2P systems [23], to how to improve neighborhood selection [17] in structured as well as unstructured systems, to how to detect P2P traffic [4], to how to develop P2P based applications [2], to how to ”