The best of both worlds: A hybrid approach to solve consensus

Proceedings of the 2002 International Conference on Dependable Systems and Networks

Volumn , Issue , 2000, Pages 513-522

  Mostefaoui, Achour ^a   Raynal, Michel ^a   Tronel, Frédéric ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous distributed system; Consensus problem; Crash failure; Fault tolerance; Message passing; Randomized protocol; Unreliable failure detector

Indexed keywords

ASYNCHRONOUS DISTRIBUTED SYSTEM; CONSENSUS PROBLEM; CRASH FAILURE; MESSAGE PASSING; RANDOMIZATION;

DISTRIBUTED COMPUTER SYSTEMS; EVALUATION; NETWORK PROTOCOLS; PERFORMANCE; PROBABILITY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0034590442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDSN.2000.857584     Document Type: Conference Paper

References (16)

1. Aguilera M.K. and Toueg S., Failure Detection and Randomization: a Hybrid Approach to Solve Consensus. SIAM Journal of Computing, 28(3):890-903, 1998.
2. Ben-Or M., Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. 2nd ACM Symposium on Principles of Distributed Computing, (PODC'83), Montréal (CA), pp. 27-30, 1983.
3. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2), 225-267, 1996.
4. Chor M., and Dwork C., Randomization in Byzantine Agreement. Adv. in Comp. Research, 5:443-497, 1989.
5. Dolev D. and Malki D., Consensus Made Practical. Tech report CS94-7, The Hebrew University of Jerusalem, 1994.
6. Fischer M.J., Lynch N. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374-382, 1985.
7. Fritzke U., Ingels Ph., Mostefaoui A. and Raynal M., Fault-Tolerant Total Order Multicast to Asynchronous Groups. Proc. 17th IEEE Symposium on Reliable Distributed Systems, Purdue University (IN), pp.228-234, October 1998.
8. Goldreich O. and Petrank E., The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. Inf. Proc. Letters, 39:45-49, 1990.
9. Guerraoui R., Revisiting the Relationship between Non-Blocking Atomic Commitment and Consensus. Proc. 9th Int. Workshop on Distributed Algorithms (WDAG95), Springer-Verlag LNCS 972, pp. 87-100, 1995.
10. Hurfin M. and Raynal M., A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector. Distributed Computing, 12(4):209-223, 1999.
11. Mostefaoui A. and Raynal M., Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: a Generic Quorum-Based Approach. Proc. 13th Int. Symposium on Distributed Computing (DISC'99), (Formerly WDAG), Springer-Verlag LNCS 1693, pp.49-63, 1999.
12. Mostefaoui A., Raynal M. and Tronel F., From Binary Consensus to Multivalued Consensus in Asynchronous Distributed Systems. To appear in Inf. Proc. Letters, 2000.
13. Motvani R. and Raghavan P., Randomized Algorithms. Cambridge University Press, 476 p., 1995.
14. Rabin M., Randomized Byzantine Generals. Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS'83), pp. 116-124, Los Alamitos (CA), 1983.
15. Rodrigues L. and Verissimo P., Topology-Aware Algorithms for Large Scale Communications. in Advances in Dist. Systems, Springer-Verlag LNCS 1752, pp. 127-156, 2000.
16. Schiper A., Early Consensus in an Asynchronous System with a Weak Failure Detector. Distributed Computing, 10:149-157, 1997.