Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Enhanced Fault-Tolerance through Byzantine Failure Detection
verfasst von : Rida A. Bazzi, Maurice Herlihy
Erschienen in: Principles of Distributed Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider a variant of the Byzantine failure model in which Byzantine processes are eventually detected and silenced, and investigate the fault-tolerance of the classical broadcast and agreement problems. We show that if all Byzantine processes are eventually detected, then it is possible to solve the broadcast problem in the presence of any number of Byzantine processes. If only a fraction of the Byzantine processes can be detected, then we show that it is possible to solve consensus (and broadcast) if the total number of processes is
N
≥ 2
f
+ 3
F
+ 1, where
f
is the number of Byzantine processes that are eventually detected and
F
is the number of those that are never detected. We show that 2
f
+ 3
F
+ 1 is a lower bound to solve the consensus and broadcast problems.