Year: 2003
Type: conference-paper
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. 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.
Source: ACM SIGCOMM Conference (SIGCOMM)
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: National Science Foundation
Awards: Incentive-Compatible Designs for Distributed Systems, ITR/ANI: Addressing Fundamental Issues for Robust Internet Performance, ITR/SY: Discrete Models & Algorithms in the Sciences, ITR: Robust Large-Scale Distributed Systems, Learning and the Design of the Internet, ITR: Analysis of Internet Algorithms: Optimization, Game Theory and Competitive Analysis
OpenAlex ID: W2169047226