Counter-based reliability optimization for gossip-based broadcasting

Authors:
Tatsuhiro Tsuchiya;Shinichi Ikeda;Tohru Kikuno
Affiliations:
Osaka University, Graduate School of Information Science and Technology, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan;Osaka University, Graduate School of Information Science and Technology, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan;Osaka University, Graduate School of Information Science and Technology, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan
Venue:
Computer Communications
Year:
2006

Citing 19
Cited 0

On spreading a rumor

SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Epidemic algorithms in replicated databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Gossip-Style Failure Detection and Distributed Consensus for Scalable Heterogeneous Clusters

Cluster Computing
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Gossip versus Deterministically Constrained Flooding on Small Networks

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
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

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
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
Epidemic Information Dissemination in Distributed Systems

Computer
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Cost-effective broadcast for fully decentralized peer-to-peer networks

Computer Communications
A lightweight, robust P2P system to handle flash crowds

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Gossip-based broadcasting has recently gained popularity as a potentially effective solution for disseminating information in large-scale distributed applications. In this paper we propose a simple counter-based optimization for gossip-based broadcast protocols, aimed at enhancing reliability in the face of node failures. The basic idea is to have each node retransmit a broadcast message when the node has received the same message only a few times; a node thus can autonomously perceive the status of message dissemination and promote it when necessary. The usefulness of the technique is demonstrated through simulation results.