The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (2012 vol. 9)
ISSN: 1545-5971
pp: 236-249
Fatemeh Borran , École Polytechnique Fédérale de Lausanne, Lausanne
Martin Hutle , Fraunhofer AISEC, Munich
Nuno Santos , École Polytechnique Fédérale de Lausanne, Lausanne
André Schiper , École Polytechnique Fédérale de Lausanne, Lausanne
ABSTRACT
Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address this question for round-based consensus algorithms using communication predicates, on top of a partial synchronous system that alternates between good and bad periods (synchronous and nonsynchronous periods). Communication predicates together with the detailed timing information of the underlying partially synchronous system provide a convenient and powerful framework for comparing different consensus algorithms and their implementations. This approach allows us to quantify the required length of a good period to solve a given number of consensus instances. With our results, we can observe several interesting issues, such as the number of rounds of an algorithm is not necessarily a good metric for its performance.
INDEX TERMS
Distributed systems, fault tolerance, distributed algorithms, round-based model, consensus, system modeling.
CITATION

N. Santos, A. Schiper, M. Hutle and F. Borran, "Quantitative Analysis of Consensus Algorithms," in IEEE Transactions on Dependable and Secure Computing, vol. 9, no. , pp. 236-249, 2011.
doi:10.1109/TDSC.2011.48
80 ms
(Ver 3.3 (11022016))