Advertisement

Directional Gossip: Gossip in a Wide Area Network

  • Meng-Jang Lin
  • Keith Marzullo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1667)

Abstract

A reliable multicast protocol ensures that all of the intended recipients of a message m that do not fail eventually deliver m. For example, consider the reliable multicast protocol of 11, and consider a message m, sent by process p 1, that is intended to be delivered by p 1, p 2, and p 3. We impose a directed spanning tree on these processes that is rooted at the message source. For example, for m we could have the directed spanning tree p 1p 2p 3. The message m propagates down this spanning tree and acknowledgments of the receipt of m propagate back up the tree. A leaf process in this tree delivers m when it receives m, and a non-leaf process delivers m when it gets the acknowledgment for m from all of its children. If a non-leaf process (say, p 1) does not get an acknowledgment for m from one of its children (here, p 2), then it removes the child from the tree and “adopts” that child’s children (here, p 3). The process sends m to the newly-adopted children and continues the broadcast. A similar monitoring and adoption approach is used to recover from the failure of the root of the tree.

Keywords

Span Tree Area Network Local Area Network Link Failure Wide Area Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. R. Andrews. Concurrent programming: principles and practice, Benjamin/Cummings, 1991.Google Scholar
  2. 2.
    K. Birman, et al. Bimodal multicast. Cornell University, Department of Computer Science Technical Report TR-98-1665, May 1998.Google Scholar
  3. 3.
    S. E. Deering. Multicast routing in internetworks and extended LANs. In Proceedings of ACM SIGCOMM’ 88, Stanford, California, USA, 16-19 August 1988, pp. 55–64.Google Scholar
  4. 4.
    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
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    L. R. Ford and D. R. Fulkerson. Maximum flow through a network. Canadian Journal of Mathematics 8(1956):399–404.zbMATHMathSciNetGoogle Scholar
  7. 7.
    R. A. Golding and D. E. Long. The performance of weak-consistency replication protocols. University of California at Santa Cruz, Computer Research Laboratory Technical Report UCSC-CRL-92-30, July 1992.Google Scholar
  8. 8.
    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 1997.Google Scholar
  9. 9.
    J. Kephart and S. White. Directed-graph epidemiological models of computer viruses. In Proceedings of IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, California, USA, 20-22 May 1991, pp. 345–359.Google Scholar
  10. 10.
    M.-J. Lin, A. Ricciardi, and K. Marzullo. A new model for availability in the face of self-propagating attacks. In Proceedings of New Security Paradigm Workshop, Charlottesville, Virginia, USA, 22-25 September 1998.Google Scholar
  11. 11.
    F. B. Schneider, D. Gries, and R. D. Schlichting. Fault-tolerant broadcasts. Science of Computer Programming 4(1):1–15, April 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    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
  13. 13.
    E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE Infocom’ 96, San Francisco, California, USA, 24-28 March 1996, pp. 594–602, Volume 2.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Meng-Jang Lin
    • 1
  • Keith Marzullo
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of Texas at AustinAustinTX
  2. 2.Department of Computer Science and EngineeringUniversity of California, San DiegoLa JollaCA

Personalised recommendations