Improving the robustness of epidemic communication in scale-free networks

Authors:
Takuya Okuyama;Tatsuhiro Tsuchiya;Tohru Kikuno
Affiliations:
Graduate School of Information Science and Technology, Osaka University, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan
Venue:
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Year:
2006

Citing 14
Cited 1

Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mapping the Gnutella Network

IEEE Internet Computing
Gossip versus Deterministically Constrained Flooding on Small Networks

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Gossip-Based Reliable Multicast for Large-Scale High-Throughput Applications

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Scalable Fault-Tolerant Aggregation in Large Process Groups

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
Robust Aggregation Protocols for Large-Scale Overlay Networks

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
The cover time of two classes of random graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Epidemic Information Dissemination in Distributed Systems

Computer
Cost-effective broadcast for fully decentralized peer-to-peer networks

Computer Communications

A survey on bio-inspired networking

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the name suggests, epidemic protocols mimic spread of virus to implement broadcasting with high reliability and low communication cost in peer-to-peer (P2P) overlay networks. In this paper, we study the reliability of epidemic protocols in scale-free networks, an important class of P2P overlay network topologies. In order to improve the robustness of epidemic protocols, we optimize the basic epidemic protocol in the following two ways. One optimization is to introduce an adaptive mechanism that allows each node to retransmit a broadcast message adaptively to the environment. The other optimization is to modify the protocol such that nodes will forward broadcast messages preferentially to neighbor nodes of small degree. The usefulness of these optimizations is demonstrated through simulation results.