Failure detection and randomization: A hybrid approach to solve consensus

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 890-903

  Aguilera, Marcos Kawazoe ^a   Toueg, Sam ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Agreement problem; Algorithms; Asynchronous systems; Byzantine generals' problem; Consensus problem; Crash failures; Failure detection; Fault tolerance; Message passing; Processor failures; Randomized algorithms; Reliability

Indexed keywords

DATA COMMUNICATION SYSTEMS; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MICROCOMPUTERS; RELIABILITY;

ASYNCHRONOUS SYSTEMS; BYZANTINE GENERAL PROBLEM; CONSENSUS PROBLEM; CRASH FAILURES; FAILURE DETECTION; MESSAGE PASSING; PROCESSOR FAILURES; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0032277585     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796312915     Document Type: Article

References (29)

1. M. K. AGUILERA, W. CHEN, AND S. TOUEG, Heartbeat: A timeout-free failure detector for quiescent reliable communication, in Proc. of the 11th International Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci., Springer-Verlag, New York, 1997, pp. 126-140.
2. A full version is also available as Tech. report 97-1631, Department of Computer Science, Cornell University, Ithaca, NY, 1997.
3. M. K. AGUILERA, W. CHEN, AND S. TOUEG, Quiescent Reliable Communication and Quiescent Consensus in Partitionable Networks, Tech. report 97-1632, Department of Computer Science, Cornell University, Ithaca, NY, 1997;
4. revised version to appear in Theoret. Comput. Sci. as Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks.
5. O. BABAOǦLU, R. DAVOLI, AND A. MONTRESOR, Failure Detectors, Group Membership and View-synchronous Communication in Partitionable Asynchronous Systems (Preliminary Version), Tech. report UBLCS-95-18, Department of Computer Science, University of Bologna, Bologna, Italy, 1995.
6. M. BEN-OR, Another advantage of free choice: Completely asynchronous agreement protocols, in Proc. of the Second ACM Symposium on Principles of Distributed Computing, ACM, New York, 1983, pp. 27-30.
7. G. BRACHA AND S. TOUEG, Resilient consensus protocols, in Proc. of the Second ACM Symposium on Principles of Distributed Computing, ACM, New York, 1983, pp. 12-26.
8. An extended and revised version appeared as Asynchronous consensus and broadcast protocols, J. Assoc. Comput. Mach., 32 (1985), pp. 824-840.
9. T. D. CHANDRA, V. HADZILACOS, AND S. TOUEG, The weakest failure detector for solving consensus, J. Assoc. Comput. Mach., 43 (1996), pp. 685-722.
10. T. D. CHANDRA AND S. TOUEG, Unreliable failure detectors for reliable distributed systems, J. Assoc. Comput. Mach., 43 (1996), pp. 225-267.
11. B. CHOR AND C. DWORK, Randomization in Byzantine agreement, Adv. Comput. Res., 4 (1989), pp. 443-497.
12. B. CHOR, M. MERRITT, AND D. B. SHMOYS, Simple constant-time consensus protocols in realistic failure models, J. Assoc. Comput. Mach., 36 (1989), pp. 591-614.
13. D. DOLEV, C. DWORK, AND L. STOCKMEYER, On the minimal synchronism needed for distributed consensus, J. Assoc. Comput. Mach., 34 (1987), pp. 77-97.
14. D. DOLEV, R. FRIEDMAN, I. KEIDAR, AND D. MALKHI, Failure Detectors in Omission Failure Environments, Tech. report TR96-1608, Department of Computer Science, Cornell University, Ithaca, NY, 1996.
15. D. DOLEV AND D. MALKI, Consensus Made Practical, Tech. report CS94-7, The Hebrew University of Jerusalem, 1994.
16. C. DWORK, N. A. LYNCH, AND L. STOCKMEYER, Consensus in the presence of partial synchrony, J. Assoc. Comput. Mach., 35 (1988), pp. 288-323.
17. M. J. FISCHER, N. A. LYNCH, AND M. S. PATERSON, Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach., 32 (1985), pp. 374-382.
18. O. GOLDREICH AND E. PETRANK, The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols, Inform. Process. Lett., 36 (1990), pp. 45-49.
19. R. GUERRAOUI AND A. SCHIPER, Non blocking atomic commitment with an unreliable failure detector, in Proc. of the 14th IEEE Symposium on Reliable Distributed Systems, Bad Neuenahr, Germany, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 41-50.
20. R. GUERRAOUI AND A. SCHIPER, Consensus service: A modular approach for building agreement protocols in distributed systems, in Proc. of the 26th IEEE International Symposium on Fault-Tolerant Computing, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 168-177.
21. M. HURFIN, A. MOSTEFAOUI, AND M. RAYNAL, Consensus in Asynchronous Systems Where Processes Can Crash and Recover, Tech. report 1144, Institut de Recherche en Informatique et Systèmes Aléatoires, Université de Rennes, 1997;
22. Proc. 17th IEEE Symposium on Reliable Distributed Systems (SRDS '98), IEEE Computer Society Press, Washington, DC, to appear.
23. W.-K. Lo AND V. HADZILACOS, Using failure detectors to solve consensus in asynchronous shared-memory systems, in Proc. of the Eighth International Workshop on Distributed Algorithms, Springer-Verlag, New York, 1994, pp. 284-295.
24. D. MALKHI AND M. REITER, Unreliable intrusion detection in distributed computations, in Proc. of the 10th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 116-124.
25. R. OLIVEIRA, R. GUERRAOUI, AND A. SCHIPER, Consensus in the Crash-Recover Model, Tech. report 97-239, Département d'Informatique, Ecole Polytechnique Fédérale, Lausanne, Switzerland, 1997.
26. M. RABIN, Randomized Byzantine generals, in Proc. of the 24th Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 403-409.
27. A. SCHIPER, Early consensus in an asynchronous system with a weak failure detector, Distrib. Comput., 10 (1997), pp. 149-157.
28. S. TOUEG, Randomized Byzantine agreements, in Proc. of the Third ACM Symposium on Principles of Distributed Computing, ACM, New York, 1984, pp. 163-178.
29. A. ZAMSKY, A randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time, in Proc. of the Fifteenth ACM Symposium on Principles of Distributed Computing, ACM, New York, 1996, pp. 201-208.