000166974 001__ 166974
000166974 005__ 20190316235145.0
000166974 0247_ $$2doi$$a10.1109/LADC.2011.12
000166974 037__ $$aCONF
000166974 245__ $$aTiming Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
000166974 269__ $$a2011
000166974 260__ $$bIEEE$$c2011
000166974 336__ $$aConference Papers
000166974 520__ $$aWe 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.
000166974 6531_ $$adistributed algorithms
000166974 6531_ $$aByzantine consensus
000166974 6531_ $$atiming analysis
000166974 700__ $$0243463$$aBorran, Fatemeh$$g149659
000166974 700__ $$0243462$$aHutle, Martin$$g172802
000166974 700__ $$0241767$$aSchiper, André$$g106377
000166974 7112_ $$a2011 5th Latin-American Symposium on Dependable Computing (LADC)$$cSao Jose dos Campos, Brazil$$d25-29 04 2011
000166974 773__ $$q166-175$$t2011 5th Latin-American Symposium on Dependable Computing
000166974 8564_ $$uhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5783396&tag=1$$zURL
000166974 8564_ $$s414545$$uhttps://infoscience.epfl.ch/record/166974/files/LADC2011.pdf$$yn/a$$zn/a
000166974 909C0 $$0252206$$pLSR$$xU10411
000166974 909CO $$ooai:infoscience.tind.io:166974$$pconf$$pIC$$qGLOBAL_SET
000166974 917Z8 $$x149659
000166974 917Z8 $$x149659
000166974 917Z8 $$x149659
000166974 937__ $$aEPFL-CONF-166974
000166974 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000166974 980__ $$aCONF