Fault tolerance in networks of bounded degree

Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

Research output: Contribution to journalArticlepeer-review

80 Scopus citations


We define a new paradigm for distributed computing, almost-everywhere agreement, in which we require only that almost all correct processors reach consensus. Unlike the traditional Byzantine agreement problem, almost-everywhere agreement can be solved on networks of bounded degree. Specifically, we can simulate any sufficiently resilient Byzantine agreement algorithm on a network of bounded degree using our communication scheme described above. Although we 'lose' some correct processors, effectively treating them as faulty, the vast majority of correct processors decide on a common value.

Original languageEnglish
Pages (from-to)975-988
Number of pages14
JournalSIAM Journal on Computing
Issue number5
StatePublished - 1988
Externally publishedYes


Dive into the research topics of 'Fault tolerance in networks of bounded degree'. Together they form a unique fingerprint.

Cite this