Fast Consensus in Networks of Bounded Degree (Extended Abstract)

In a Distributed Consensus protocol all processors (of which t may be faulty) are given (binary) initial values; after exchanging messages all correct processors must agree on one of them. In this paper we focus on consensus in networks that are not completely interconnected, following the work of Dwork et al. [DPPU]. In such a context, complete consensus among all the correct processors is not possible and some exceptions must be allowed.

[1]  Silvio Micali,et al.  Optimal algorithms for Byzantine agreement , 1988, STOC '88.

[2]  Piotr Berman,et al.  Asymptotically Optimal Distributed Consensus (Extended Abstract) , 1989, ICALP.

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  Danny Dolev,et al.  Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.

[5]  B. Bollobás.  Combinatorics: Random graphs , 1981 .

[6]  Piotr Berman,et al.  Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Brian A. Coan,et al.  Modular construction of nearly optimal Byzantine agreement protocols , 1989, PODC '89.

[8]  Eli Upfal,et al.  Fault tolerance in networks of bounded degree , 1986, STOC '86.

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

[10]  Danny Dolev,et al.  Families of Consensus Algorithms , 1988, AWOC.

[11]  Yoram Moses,et al.  Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Nicholas Pippenger,et al.  On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[14]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

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