Copyright © 2006 Elsevier B.V. All rights reserved.
Counter-based reliability optimization for gossip-based broadcasting
Received 12 January 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Keywords: Gossip; Epidemic; Broadcast; Overlay networks; Reliability; Distributed systems







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

3, several results for gossiping in graphs of constant degree and planar graphs, as well as similar results for the related edge-disjoint paths mode follow.




