Skip to main content
SpringerLink
Log in

Gossip versus Deterministically Constrained Flooding on Small Networks

  • Conference paper
  • First Online:
Distributed Computing (DISC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1914))

Included in the following conference series:

Abstract

Rumor mongering (also known as gossip) is an epidemiolog- ical protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. However, rumor mongering uses random selection for communications. We study the impact of using random selection in this paper. We present a protocol that superficially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one remaining attraction that rumor mongering has over the determinisitic protocol-namely graceful degradation-comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet and small wide area network of Ethernets.

This research was support in part by DARPA grant N66001-98-8911 and NSF award CCR-9803743. Most of this work was done when Dr Lin was a graduate student at UT Austin.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. R. Andrews. Concurrent programming: Principles and practice, Benjamin/Cummings, 1991.

    Google Scholar 

  2. ö. Babaoglu. On the reliability of consensus-based fault-tolerant distributed computing systems. ACM Transactions on Computer Systems, 5(4):394–416 (November 1987).

    Article  Google Scholar 

  3. L. W. Beineke and F. Harary. The connectivity function of a graph. Mathematika 14:197–202 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  4. K. Birman et al. Bimodal multicast. ACM Transactions on Computer Systems 17(2):41–88 (May 1999).

    Article  MathSciNet  Google Scholar 

  5. M. Clegg and K. Marzullo. A Low-cost processor group membership protocol for a hard real-time distributed system. In Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997, pp. 90–98.

    Google Scholar 

  6. C. J. Colbourn. The combinatorics of network reliability, Oxford University Press, 1987.

    Google Scholar 

  7. F. Cristian. Synchronous atomic broadcast for redundant broadcast channels. Real-Time Systems 2(3):195–212 (September 1990).

    Article  Google Scholar 

  8. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems 10(6):642–657 (June 1999).

    Article  Google Scholar 

  9. A. Demers et al. Epidemic algorithms for replicated database maintenance. In Proceedings of 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10-12 August 1987, pp. 1–12.

    Google Scholar 

  10. S. Floyd et al. A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Transactions on Networking 5(6):784–803 (December 1997).

    Article  Google Scholar 

  11. R. Friedman, S. Manor and K. Guo. Scalable stability detection using logical hypercube. Technion Department of Computer Science Technical Report 0960, May 1999.

    Google Scholar 

  12. R. A. Golding and D. E. Long. The performance of weak-consistency replication protocols. University of California Santa Cruz, Computer Research Laboratory Technical Report UCSC-CRL-92-30, July 1992.

    Google Scholar 

  13. K. Guo et al. GSGC: an efficient gossip-style garbage collection scheme for scalable reliable multicast. Cornell University, Department of Computer Science Technical Report TR-97-1656, December 3 1997.

    Google Scholar 

  14. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems (S. Mullender, ed.), ACM Press, 1993.

    Google Scholar 

  15. F. Harary. The maximum connectivity of a graph. In Proceedings of the National Academy of Sciences, 48:1142–1146 (1962).

    Article  MATH  MathSciNet  Google Scholar 

  16. M. G. Hayden and K. P. Birman. Probabilistic broadcast. Cornell University, Department of Computer Science Technical Report TR-96-1606, September 1996.

    Google Scholar 

  17. T. Abdelzaher, A. Shaikh, F. Jahanian and K. Shin. RTCAST: Lightweight multicast for real-time process groups. In Proceedings of the Second IEEE Real-Time Technology and Applications Symposium, 1996, pp.250–259.

    Google Scholar 

  18. A. Liestman. Fault-tolerant broadcast graphs. Networks 15(2): 159-171 (Summer 1985).

    Google Scholar 

  19. M. J. Lin and K. Marzullo. Directional gossip: gossip in a wide area network. In Proceedings of the Third European Dependable Computing Conference, Prague, Czech Republic, September 1999 (Springer-Verlag LNCS 1667), pp. 364–379.

    Google Scholar 

  20. M. J. Lin, K. Marzullo and S. Masini. Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small network. University of California San Diego Department of Computer Science Technical Report CS99-0637, November 1999.

    Google Scholar 

  21. A. Pelc. Fault-tolerant broadcast and gossiping in communication networks. Networks 28(3):143–156 (October 1996).

    Article  MATH  MathSciNet  Google Scholar 

  22. B. Pittel. On spreading a rumor. SI AM Journal on Applied Mathematics, 47(l):213–223 (February 1987).

    Article  MATH  MathSciNet  Google Scholar 

  23. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing (Middleware ’98), The Lake District, England, September 1998, pp. 55–70.

    Google Scholar 

  24. Fred B. Schneider. Byzantine generals in action: implementing fail-stop processors. ACM Transactions on Computer Systems 2(2):145–154 (May 1984).

    Article  Google Scholar 

  25. Amitabh Shah. Exploring Trade-offs in the Design of Fault-Tolerant Distributed Databases. Ph.D. dissertation, Cornell University Department of Computer Science, August 1990.

    Google Scholar 

  26. D. B. Terry et al. Managing update conflicts in Bayou, a weakly connected replicated storage system. In Proceedings of the 15th Symposium on Operating System Principles, 1995, pp. 3–6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Somerset Design Center, Motorola, Inc., Austin, TX

    Meng-Jang Lin

  2. Department of Computer Science and Engineering, University of California San Diego, La Jolla, CA

    Keith Marzullo

  3. Department of Computer Science, University of Bologna, Bologna, Italy

    Stefano Masini

Authors
  1. Meng-Jang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith Marzullo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefano Masini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, MJ., Marzullo, K., Masini, S. (2000). Gossip versus Deterministically Constrained Flooding on Small Networks. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation