Directional gossip: Gossip in a wide area network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1667 LNCS, Issue , 1999, Pages 364-379

  Lin, Meng Jang ^a   Marzullo, Keith ^b  

^a The University of Texas at Austin   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84881253506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48254-7_25     Document Type: Conference Paper

References (13)

1. G. R. Andrews. Concurrent programming: principles and practice, Benjamin/Cummings, 1991.
2. K. Birman, et al. Bimodal multicast. Cornell University, Department of Computer Science Technical Report TR-98-1665, May 1998.
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.
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.
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.
6. L. R. Ford and D. R. Fulkerson. Maximum flow through a network. Canadian Journal of Mathematics 8(1956):399-404.
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.
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.
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.
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.
11. F. B. Schneider, D. Gries, and R. D. Schlichting. Fault-tolerant broadcasts. Science of Computer Programming 4(1):1-15, April 1984.
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.
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.