Gossip versus deterministieally constrained flooding on small networks

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

Volumn 1914, Issue , 2000, Pages 253-267

  Lin, Meng Jang ^a   Marzullo, Keith ^b   Masini, Stefano ^c  

^a MOTOROLA INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ETHERNET;

ABSTRACT LEVELS; GRACEFUL DEGRADATION; HIGH COSTS; NEW PROTOCOL; RANDOM SELECTION; RUMOR-MONGERING; SMALL NETWORKS;

WIDE AREA NETWORKS;

EID: 84958774651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_17     Document Type: Conference Paper

References (27)

1. G. R. Andrews. Concurrent programming: Principles and practice, Ben¬jamin/Cummings, 1991.
2. O. Babaoglu. On the reliability of consensus-based fault-tolerant distributed com¬puting systems. ACM Transactions on Computer System,s., 5(4):394-416 (November 1987).
3. L. W. Beineke and F. Harary. The connectivity function of a graph. Mathematika 14:197-202 (1967).
4. K. Birman et al. Bimodal multicast. ACM Transactions on Computer Systems 17(2):41-88 (May 1999).
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.
6. C. J. Colbourn. The combinatorics of network reliability, Oxford University Press, 1987.
7. F. Cristian. Synchronous atomic broadcast for redundant broadcast channels. Real¬Time Systems 2(3):195-212 (September 1990).
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).
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.
10. S. Floyd et al. A reliable multicast framework for light-weight sessions and appli¬cation level framing. IEEE/ACM Transactions on Networking 5(6):784-803 (December 1997).
11. R. Friedman, S. Manor and K. Guo. Scalable stability detection using logical hy¬percube. Technion Department of Computer Science Technical Report 0960, May 1999.
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.
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.
14. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems (S. Mullender, editor), ACM Press, 1993.
15. F. Harary. The maximum connectivity of a graph. In Proceedings of the National Academ,y of Sciences, 48:1142-1146 (1962).
16. M. G. Hayden and K. P. Birman. Probabilistic broadcast. Cornell University, De¬partment of Computer Science Technical Report TR-96-1606, September 1996.
17. T. Abdelzaher, A. Shaikh, F. Jahanian and K. Shin. RTCAST: Lightweight mul¬ticast for real-time process groups. In Proceedings of the Second IEEE Real- Time Technology and Applications Symposium, 1996, pp.250-259.
18. A. Liestman. Fault-tolerant broadcast graphs. Networks 15(2):159-171 (Summer 1985).
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.
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.
21. A. Pelc. Fault-tolerant broadcast and gossiping in communication networks. Net¬works 28(3):143-156 (October 1996).
22. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(l):213-223 (February 1987).
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 Platform,s and Open Distributed Processing (Middleware’98), The Lake District, England, September 1998, pp. 55-70.
24. Fred B. Schneider. Byzantine generals in action: implementing fail-stop processors. ACM Transactions on Computer Systems 2(2):145-154 (May 1984).
25. Amitabh Shah. Exploring Trade-offs in the Design of Fault-Tolerant Distributed Databases. Ph.D. dissertation, Cornell University Department of Computer Sci¬ence, August 1990.
26. D. B. Terry et al. Managing update conflicts in Bayou, a weakly connected repli¬cated storage system. In Proceedings of the 15th Symposium on Operating System, Principles, 1995, pp. 3-6.
27. Network Simulator, http://www-mash.cs.berkeley.edu/ns.