Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Heterogeneous Search in Unstructured Peer-to-Peer Networks
IEEE Distributed Systems Online
Agent-based buddy-finding methodology for knowledge sharing
Information and Management
Distributed automatic target recognition using multi-agent UAV swarms
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An efficient adaptive strategy for searching in peer-to-peer networks
Multiagent and Grid Systems
MuON: Epidemic based mutual anonymity in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Management of peer-to-peer overlays
International Journal of Internet Protocol Technology
Counter-based reliability optimization for gossip-based broadcasting
Computer Communications
Agent-based buddy-finding methodology for knowledge sharing
Information and Management
A middleware for job distribution in peer-to-peer networks
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
HPC5: An efficient topology generation mechanism for Gnutella networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
NDP2PSim: a NS2-Based platform for peer-to-peer network simulations
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Efficient message flooding on DHT network
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Reliable multicast and its probabilistic model for job submission in peer-to-peer grids
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Improving the robustness of epidemic communication in scale-free networks
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
AGNO: an adaptive group communication scheme for unstructured P2P networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Improving peer-to-peer resource discovery using mobile agent based referrals
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Hi-index | 0.24 |
Fully unstructured and decentralized peer-to-peer networks such as Gnutella are appealing for a variety of applications, among which file-sharing is the most prominent one. The decentralized nature of these systems provides a high degree of robustness and the ability to cope with a highly dynamic and transient network environment. However, the lack of centralized directory nodes makes the task of searching more expensive and difficult. In completely unstructured peer-to-peer networks, searching can only be realized via application-layer broadcast, where query messages are routed to every node in the network. Gnutella implements application-layer broadcast by using flooding as the underlying message routing mechanism. Flooding creates a large amount of traffic and can quickly exhaust the resources of nodes in a large network. In this paper, we explore Rumor mongering (also known as Gossip) as a more cost-effective and scalable alternative to flooding for implementing services such as searching in decentralized peer-to-peer networks. We further present a new variant of the Rumor mongering protocol, which exploits the power-law characteristics of typical peer-to-peer networks and achieves a significant further reduction in cost.