ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Communications
Volume 29, Issue 9, 31 May 2006, Pages 1516-1521
ICON 2004 - 12th IEEE International Conference on Network 2004
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (476 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2005.09.018    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Counter-based reliability optimization for gossip-based broadcasting

Tatsuhiro TsuchiyaCorresponding Author Contact Information, E-mail The Corresponding Author, Shinichi IkedaE-mail The Corresponding Author and Tohru KikunoE-mail The Corresponding Author

Osaka University, Graduate School of Information Science and Technology, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan

Received 12 January 2005; 
revised 15 September 2005; 
accepted 27 September 2005. 
Available online 15 November 2005.

Purchase the full-text article



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

Article Outline

1. Introduction
2. Model
3. Counter-based optimization
4. Simulation
4.1. Settings
4.2. Results
4.2.1. Fault tolerance
4.2.2. Message overhead vs. reliability
5. Conclusions and future work
Acknowledgements
References






Computer Communications
Volume 29, Issue 9, 31 May 2006, Pages 1516-1521
ICON 2004 - 12th IEEE International Conference on Network 2004
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.