Making gnutella-like P2P systems scalable
AT&T (United States) · Intel (United States) · +3 more institutions
Abstract
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.…
Citation impact
- FWCI
- 86.18
- Percentile
- 100%
- References
- 26
Authors
5- YCYatin ChawatheCorresponding
AT&T (United States)
- SRSylvia Ratnasamy
Intel (United States)
- LBLee Breslau
AT&T (United States)
- NLNick Lanham
Berkeley College, University of California, Berkeley
- SSScott Shenker
Berkeley College, International Computer Science Institute, University of California, Berkeley, AT&T (United States), Intel (United States)
Topics & keywords
- Computer science
- Scalability
- Testbed
- Distributed computing
- Distributed hash table
- File sharing
- Software deployment
- Hash function