Efficient agreement using fault diagnosis

Authors:
Brian A. Coan
Affiliations:
Bellcore, 445 South Street, Morristown, NJ
Venue:
Distributed Computing
Year:
1993

Citing 11
Cited 2

A new solution for the byzantine generals problem

Information and Control
Easy impossibility proofs for distributed consensus problems

Distributed Computing
A communication-efficient canonical form for fault-tolerant distributed protocols

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Fast distributed agreement

SIAM Journal on Computing
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Modular construction of a Byzantine agreement protocol with optimal message bit complexity

Information and Computation
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

Information and Computation
Fully polynomial Byzantine agreement in t + 1 rounds

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)

A flexible formal framework for masking/demasking faults

Information Sciences—Informatics and Computer Science: An International Journal
Fast and simple distributed consensus

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an extremely simple Byzantine agreement protocol that uses O (t2) processors, min (f + 2, t + 1) rounds of communication, O (n ċ t ċ f ċ log |V|) total message bits, and O (log |V|) maximum message size, where n is the total number of processors that actually participate in the protocol, t is an upper bound on the number of faulty processors, f is the number of processors that actually fail in a given execution, and V is the set of possible inputs. This protocol uses roughly the same resources as a more complex protocol due to Dolev, Reischuk, and Strong. By adding explicit fault diagnosis to our first protocol, we produce a somewhat more complicated protocol that uses O(t1.5) processors, min (f + 2, t + 1) rounds, O(n ċ t2 ċ f ċ log|V|) total message bits, and O(tċ log|V|) maximum message size.