Encapsulating failure detection: From crash to byzantine failures

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

Volumn 2361, Issue , 2002, Pages 24-50

  Doudou, Assia ^a   Garbinato, Benoît ^a   Guerraoui, Rachid ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); CONNECTORS (STRUCTURAL);

AGREEMENT PROBLEMS; BYZANTINE FAILURES; DISTRIBUTED AGREEMENT; DISTRIBUTED SYSTEMS; ENGINEERING DISCIPLINES; FAILURE DETECTION; FAILURE DETECTORS; PROCESS CRASH FAILURE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84956987522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48046-3_3     Document Type: Conference Paper

References (17)

1. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685-722, July 1996.
2. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
3. A. Doudou. Abstractions for Byzantine-Resilient State Machine Replication. PhD thesis, Swiss Federal Institute of Technology, Lausanne (EPFL), 2000.
4. A. Doudou, B. Garbinato, and R. Guerraoui. Abstractions for Byzantine Resilient State Machine Replication. In Symposium on Reliable Distributed Systems. IEEE, October, 2000.
5. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, apr 1988.
6. M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32:374-382, April 1985.
7. M. J. Fischer. The consensus problem in unreliable distributed systems (A brief survey). In Proceedings of the International Conference on Foundations of Computations Theory, pages 127-140, Borgholm, Sweden, 1983.
8. R. Guerraoui. Non-blocking atomic commit in asynchronous sytems with failure detectors. Distributed Computing, 15(1), January 2002.
9. R. Guerraoui and A. Schiper. The generic consensus service. IEEE Transactions on Software Engineering, 27(14):29-41, January 2001.
10. K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. The secure protocols for securing group communication. In Proceedings of the 31st Hawaii International Conference on System Sciences, volume 3, pages 317-326. IEEE, January 1998.
11. K. P. Kihlstrom, Louise E. Moser, and P. M. Melliar-Smith. Solving consensus in a Byzantine environment using an unreliable fault detector. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), pages 61-75, December 1997.
12. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
13. D. Malkhi and M. Reiter. Unreliable Intrusion Detection in Distributed Computations. In Proceedings 10th Computer Security Foundations Workshop (CSFW97), pages 116-124, June 1997.
14. L. E. Moser, P. M. Melliar-Smith, and D. A. Agrawala. Total ordering algorithms. In ACMCSC: ACM Annual Computer Science Conference, 1991.
15. M. K. Reiter. Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, pages 68-80, November 1994.
16. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
17. S. Toueg. Randomized Byzantine Agreements. In Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pages 163-178, August 1983.