Byzantine-Resistant Total Ordering Algorithms

Information and Computation

Volumn 150, Issue 1, 1999, Pages 75-111

  Moser, Louise E ^a   Melliar Smith, P M ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013038366     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2770     Document Type: Article

References (31)

1. Amir, Y., Dolev, D., Kramer, S., and Malki, D. (1992), Transis: A communication sub-system for high availability, in "Proceedings, 22nd Annual International Symposium on Fault-Tolerant Computing," pp. 76-84.
2. Bar-Noy, A., Deng, X., Garay, J. A., and Kameda, T. (1991), Optimal amortized distributed consensus, Inform. and Comput. 120, 93-100.
3. Bar-Noy, A., and Dolev, D. (1991), Consensus algorithms with one-bit messages, Distrib. Comput. 4, 105-110.
4. Bazzi, R., and Neiger, G. (1992), Simulating crash failures with many faulty processors, in "Proceedings, 6th International Workshop on Distributed Algorithms," Lecture Notes in Computer Science, Vol. 647, pp. 166-184, Springer-Verlag, Berlin/New York.
5. Ben-Or, M. (1993), Another advantage of free choice: Completely asynchronous agreement protocols, in "Proceedings, 2nd Annual ACM Symposium on Principles of Distributed Computing," pp. 27-30.
6. Birman, K. P., and van Renesse, R. (1994), "Reliable Distributed Computing with the Isis Toolkit," IEEE Comput. Society Press, Los Alamitos, CA.
7. Bracha, G. (1987), Asynchronous Byzantine agreement protocols, Inform. and Comput. 75, 130-143.
8. Bracha, G., and Toueg, S. (1985), Asynchronous consensus and broadcast protocols, J. Assoc. Comput. Mach. 31, 824-840.
9. Chandra, T. D., and Toueg, S. (1996), Unreliable failure detectors for asynchronous systems, J. Assoc. Comput. Mach. 43, 225-267.
10. Chandra, T. D., Hadzilacos, V., and Toueg, S. (1996), The weakest failure detector for solving consensus, J. Assoc. Comput. Mach. 43, 685-722.
11. Chokler, G. V., Huleihel, N., and Dolev, D. (1998), An adaptive totally ordered multicast protocol that tolerates partitions, in "Proceedings, 17th ACM Symposium on Principles of Distributed Computing," pp. 237-246.
12. Cristian, F. (1991), Understanding fault-tolerant distributed systems, Commun. Assoc. Comput. Mach. 34, 56-78.
13. Dolev, D., Kramer, S., and Malki, D. (1993), Early delivery totally ordered multicast in asynchronous environments, in "Proceedings, 23rd Annual International Symposium on Fault-Tolerant Computing," pp. 544-553.
14. Fischer, M. J., Lynch, N. A., and Paterson, M. S. (1985), Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach. 32, 374-382.
15. Garay, J. A., and Perry, K. J. (1992), A continuum of failure models for distributed computing, in "Proceedings, 6th International Workshop on Distributed Algorithms," Lecture Notes in Computer Science, Vol. 647, pp. 153-165, Springer-Verlag, Berlin/New York.
16. Gopal, A., and Toueg, S. (1989), Reliable broadcast in synchronous and asynchronous environments, in "Proceedings, 3rd International Workshop on Distributed Algorithms," Lecture Notes in Computer Science, Vol. 392, pp. 110-123, Springer-Verlag, Berlin/New York.
17. Kaashoek, M. F., and Tanenbaum, A. S. (1991), Group communication in the Amoeba distributed operating system, in "Proceedings, IEEE 11th International Conference on Distributed Computing Systems," pp. 882-891.
18. Kihlstrom, K. P., Moser, L. E., and Melliar-Smith, P. M. (1998), The SecureRing protocols for securing group communication, in "Proceedings, Hawaii International Conference on System Sciences," Vol. 3, 317-326.
19. Lamport, L. (1978), Time, clocks, and the ordering of events in a distributed system, Commun. Assoc. Comput. Mach. 21, 558-565.
20. Melliar-Smith, P. M., Moser, L. E., and Agrawala, V. (1990), Broadcast protocols for distributed systems, IEEE Trans. Parallel and Distributed Systems 1, 17-25.
21. Meyer, F. J., and Pradhan, D. K. (1991), Consensus with dual failure modes, IEEE Trans. Parallel Distrib. Systems 2, 214-222.
22. Moser, L. E., Melliar-Smith, P. M., and Agrawala, V. (1993), Asynchronous fault-tolerant total ordering algorithms, SIAM J. Comput. 22, 727-750.
23. Moser, L. E., Melliar-Smith, P. M., and Agrawala, V. (1994), Processor membership in asynchronous distributed systems, IEEE Trans. Parallel and Distributed Systems 5, 459-473.
24. Moser, L. E., Melliar-Smith, P. M., Agarwal, D. A., Budhia, R. K., and Lingley-Papadopoulis, C. A. (1996), The Totem system, Communications Assoc. Comput. Mach. 39, 54-63.
25. Pease, M., Shostak, R. E., and Lamport, L. (1980), Reaching agreement in the presence of faults, J. Assoc. Comput. Mach. 27, 228-234.
26. Rabin, M. O. (1983), Randomized Byzantine generals, in "Proceedings, 24th Annual Symposium on Foundations of Computer Science," pp. 403-409.
27. Reiter, M. K. (1995), The Rampart toolkit for building high-integrity services, "Theory and Practice in Distributed Systems," Lecture Notes in Computer Science, Vol. 938, pp. 99-110, Springer-Verlag, Berlin/New York.
28. Schneider, F. B., Byzantine generals in action: Implementing fail-stop processors, ACM Trans. Comput. Syst. 2, 145-154.
29. Thambidurai, P., and Park, Y. K. (1988), Interactive consistency with multiple failure modes, in "Proceedings, 7th IEEE Symposium on Reliable Distributed Systems," pp. 93-100.
30. Toueg, S., Perry, K. J., and Srikanth, T. K. (1987), Fast distributed agreement, SIAM J. Comput. 16, 445-457.
31. van Renesse, R., Birman, K. P., and Maffeis, S. (1996), Horus: A flexible group communication system, Communications Assoc. Comput. Mach. 39, 76-83.