Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized variant of the algorithm shows a better worst-case execution time. Moreover, for the practically relevant case $t \leq 2$ ($t$ is the maximum number of Byzantine processes), this worst-case execution time is even at least as good as the execution time of the leader-based algorithms in fault-free runs.


Published in:
2011 5th Latin-American Symposium on Dependable Computing, 166-175
Presented at:
2011 5th Latin-American Symposium on Dependable Computing (LADC), Sao Jose dos Campos, Brazil, 25-29 04 2011
Year:
2011
Publisher:
IEEE
Keywords:
Laboratories:




 Record created 2011-06-17, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)