000205593 001__ 205593
000205593 005__ 20181203023759.0
000205593 0247_ $$2doi$$a10.1016/j.ic.2014.10.001
000205593 022__ $$a0890-5401
000205593 02470 $$2ISI$$a000345658400012
000205593 037__ $$aARTICLE
000205593 245__ $$aOn the impact of link faults on Byzantine agreement
000205593 260__ $$bAcademic Press Inc Elsevier Science$$c2014$$aSan Diego
000205593 269__ $$a2014
000205593 300__ $$a12
000205593 336__ $$aJournal Articles
000205593 500__ $$a6th International Conference on Language and Automata Theory and Applications (LATA), A Coruna, SPAIN, MAR 05-09, 2012
000205593 520__ $$aAgreement problems and their solutions are essential to fault-tolerant distributed computing. Over the years, different assumptions on failures have been considered, but most of these assumptions were focusing on either processes or links. In contrast, we examine a model where both links and processes can fail. In this model we devise a unified lower bound for resilience to both classes of faults. We show that the bound is tight by devising a simple retransmission scheme that allows optimally resilient algorithms to be constructed from well known algorithms by transparently adding link-fault tolerance. Our results show that when considering multiple independent failure modes, resilience bounds are not necessarily additive. (C) 2014 Elsevier Inc. All rights reserved.
000205593 6531_ $$aFault-tolerant distributed algorithms
000205593 6531_ $$aConsensus
000205593 6531_ $$aFault models
000205593 6531_ $$aLink faults
000205593 6531_ $$aByzantine faults
000205593 700__ $$g207256$$uVienna Univ Technol, Embedded Comp Syst Grp, A-1040 Vienna, Austria$$aBiely, Martin$$0244936
000205593 773__ $$j239$$tInformation And Computation$$q170-181
000205593 909C0 $$xU10411$$0252206$$pLSR
000205593 909CO $$pIC$$particle$$ooai:infoscience.tind.io:205593
000205593 937__ $$aEPFL-ARTICLE-205593
000205593 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000205593 980__ $$aARTICLE