Performance comparison of a rotating coordinator and a leader based consensus algorithm

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2004, Pages 4-17

  Urbán, Péter ^a   Hayashibara, Naohiro ^a   Schiper, André ^b   Katayama, Takuya ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b EPFL   (Switzerland)

Author keywords

Asynchronous; Atomic broadcast; Consensus; Failure detector; Leader; Rotating coordinator; Simulation

Indexed keywords

BROADCASTING; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING;

ASYNCHRONOUS; ATOMIC BROADCAST; CONSENSUS; FAILURE DETECTOR; LEADER; ROTATING COORDINATOR;

ALGORITHMS;

EID: 16244419361     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/reldis.2004.1352999     Document Type: Conference Paper

References (34)

1. E. Anceaume. A lightweight solution to uniform atomic broadcast for asynchronous systems. In Proc. 27th Int'l Symp. on Fault-Tolerant Computing (FTCS-27), pages 292-301, Seattle, WA, USA, June 1997.
2. M. Barborak, M. Malek, and A. Dahbura. The consensus problem in distributed computing. ACM Computing Surveys, 25(2):171-220, June 1993.
3. R. Boichat, P. Dutta, S. Frøhind, and R. Guerraoui. Deconstructing Paxos. SIGACT News, 34(1):47-67, 2003.
4. 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.
5. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225267, 1996.
6. W. Chen, S. Toueg, and M. K. Aguilera. On the quality of service of failure detectors. IEEE Trans. on Computers, 51(2):561-580, May 2002.
7. F. Chu. Reducing Ω to ◇ W. Information Processing Letters, 67(6):289-293, Sept. 1998.
8. A. Coccoli, P. Urbán, A. Bondavalli, and A. Schiper. Performance analysis of a consensus algorithm combining Stochastic Activity Networks and measurements. In Proc. Int'l Performance and Dependability Symp., pages 551-560, Washington, DC, USA, June 2002.
9. X. Défago and A. Schiper. Specification of replication techniques, semi-passive replication, and lazy consensus. Research Report KS-RR-2002-001, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, Feb. 2002.
10. X. Défago, A. Schiper, and P. Urbán. Total order broadcast and multicast algorithms: Taxonomy and survey. Research Report IS-RR-2003-009, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, Sept. 2003.
11. C. Fetzer, M. Raynal, and F. Tronel. An adaptive failure detection protocol. In Proc. 8th IEEE Pacific Rim Symp. on Dependable Computing (PRDC-8), Seoul, Korea, Dec. 2001.
12. R. Friedman and R. van Renesse. Packing messages as a tool for boosting the performance of total ordering protocols. TR 95-1527, Dept. of Computer Science, Cornell University, Ithaca, NY, USA, July 1995.
13. S. Frolund and F. Redone. Revisiting reliable broadcast. Technical Report HPL-2001-192, HP Laboratories, Palo Alto, CA, USA, Aug. 2001.
14. J. Gray. Why do computers stop and what can be done about it ? In Proc. 5th Symp. on Reliablity in Distributed Software and Database systems, Jan. 1986.
15. R. Guerraoui and A. Schiper. The generic consensus service. IEEE Trans. on Software Engineering, 27(1):29-41, Jan. 2001.
16. V. Hadzilacos and S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. TR 94-1425, Dept. of Computer Science, Cornell University, Ithaca, NY, USA, May 1994.
17. N. Hayashibara, P. Urbán, A. Schiper, and T. Katayama. Performance comparison between the Paxos and Chandra-Toueg consensus algorithms. In Proc. Int'l Arab Conf. on Information Technology (ACIT 2002), pages 526-533, Doha, Qatar, Dec. 2002.
18. L. Lamport. The part-time parliament. ACM Trans. on Computer Systems, 16(2): 133-169, 1998.
19. H. Madeira, K. Kanoun, J. Arlat, Y. Crouzet, A. Johansson, R. Lindström, et al. Preliminarily dependability benchmark framework. Project deliverable CF2, Dependability Benchmarking project (DBench), EC IST-2000-25425, Aug. 2001.
20. A. Mostéfaoui and M. Raynal. Solving consensus using Chandra-Toueg's unreliable failure detectors: A general quorum-based approach. In Proc. 13th Int'l Symp. on Distributed Computing (DISC), pages 49-63, Bratislava, Slovak Republic, Sept. 1999.
21. R. D. Prisco, B. Lampson, and N. Lynch. Revisiting the PAXOS algorithm. Theoretical Computer Science, 243(1-2):35-91, July 2000.
22. H. Ramasamy, P. Pandey, J. Lyons, M. Cukier, and W. Sanders. Quantifying the cost of providing intrusion tolerance in group communication systems. In Proc. 2002 Int'l Conf. on Dependable Systems and Networks (DSN-2002), pages 229-238, Washington, DC, USA, June 2002.
23. L. Rodrigues, H. Fonseca, and P. Veríssimo. Totally ordered multicast in large-scale systems. In Proc. 16th Int'l Conf. on Distributed Computing Systems (ICDCS-16), pages 503-510, Hong Kong, May 1996.
24. L. Sampaio, F. V. Brasileiro, W. d. C. Cirne, and J. de Figueiredo. How bad are wrong suspicious: Towards adaptive distributed protocols. In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), San Francisco, CA, USA, June 2003.
25. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3): 149-157, Apr. 1997.
26. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, Dec. 1990.
27. N. Sergent, X. Défago, and A. Schiper. Impact of a failure detection mechanism on the performance of consensus. In Proc. IEEE Pacific Rim Symp. on Dependable Computing (PRDC), pages 137-145, Seoul, Korea, Dec. 2001.
28. K. Tindell, A. Burns, and A. J. Wellings. Analysis of hard real-time communications. Real-Time Systems, 9(2): 147-171, Sept. 1995.
29. P. Urbán. Evaluating the Performance of Distributed Agreement Algorithms: Tools, Methodology and Case Studies. PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland, Aug. 2003. Number 2824.
30. P. Urbán, X. Défago, and A. Schiper. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. In Proc. 9th IEEE Int'l Conf. on Computer Communications and Networks (IC3N 2000), pages 582-589, Oct. 2000.
31. P. Urbán, X. Défago, and A. Schiper. Chasing the FLP impossibility result in a LAN or how robust can a fault tolerant server be? In Proc. 20th IEEE Symp. on Reliable Distributed Systems (SRDS), pages 190-193, New Orleans, LA, USA, Oct. 2001.
32. P. Urbán, X. Défago, and A. Schiper. Neko: A single environment to simulate and prototype distributed algorithms. Journal of Information Science and Engineering, 18(6):981-997, Nov. 2002.
33. P. Urbán, N. Hayashibara, A. Schiper, and T. Katayama. Performance comparison of a rotating coordinator and a leader based consensus algorithm (extended version). Research Report IS-RR-2004-016, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, Aug. 2004.
34. P. Urbán, I. Shnayderman, and A. Schiper. Comparison of failure detectors and group membership: Performance study of two atomic broadcast algorithms. In Proc. Int'l Conf. on Dependable Systems and Networks, pages 645-654, San Francisco, CA, USA, June 2003.