A New Solution for the Byzantine Generals Problem

We define a new model for algorithms to reach Byzantine Agreement. It allows to measure the complexity more accurately, to differentiate between processor faults and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2f+4 in the worst case, where f is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Also its average performance can easily be analysed making realistic assumptions on random distributions of faults. We show that it stops with high probability after a small number of phases.

[1]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[2]  Danny Dolev,et al.  Polynomial algorithms for multiple processor agreement , 1982, STOC '82.

[3]  Danny Dolev,et al.  'Eventual' is earlier than 'immediate' , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[5]  Nancy A. Lynch,et al.  Simple and efficient Byzantine generals algorithm , 1982 .

[6]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[7]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[8]  P. M. Melliar-Smith,et al.  Synchronizing clocks in the presence of faults , 1985, JACM.

[9]  Danny Dolev,et al.  Requirements for Agreement in a Distributed System , 1982, DDB.

[10]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[11]  Rüdiger Reischuk.  A New Solution for the Byzantine Generals Problem (Extended Abstract) , 1983, FCT.

[12]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[13]  Danny Dolev,et al.  Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  Nancy A. Lynch,et al.  An Efficient Algorithm for Byzantine Agreement without Authentication , 1982, Inf. Control..