· 2014
Search and replication in unstructured peer-to-peer networks
- 1,625citations
- 2014year
Short summary
A new query algorithm using multiple random walks reduces network traffic by two orders of magnitude compared to Gnutella's flooding method, while maintaining similar query resolution speed.
AI-generated from the title and abstract; the full text is not read.
Key points
- Proposes a multiple random walk query algorithm for P2P networks.
- Reduces network traffic by two orders of magnitude compared to Gnutella's flooding.
- Achieves query resolution speeds comparable to flooding.
- Identifies uniform random graphs as the optimal network topology.
- Evaluates distributed data replication strategies.
AI-generated from the title and abstract; the full text is not read.
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 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.
The authors' abstract, as published at the source., 2014 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Networks and Communications
Computer Networks and CommunicationsComputer Science