论文信息 - Bit optimal distributed consensus

Bit optimal distributed consensus

The Distributed Consensus problem involves n processors each of which holds an initial binary value. At most t processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that non-faulty processors eventually agree on a common value that was initially held by one of them. The quality of a consensus protocol is measured using the following parameters: the number of processors n, the number of rounds of message exchange r and the total number of bits transmitted B. The known lower bounds are respectively 3t + 1, t + 1 and Ω(nt).

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

[2] 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.

[3] Joseph Y. Halpern,et al. Message-optimal protocols for Byzantine Agreement , 1993, Mathematical systems theory.

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

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

[6] Nancy A. Lynch,et al. Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.

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

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

[9] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.

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

[11] Jim Gray,et al. The cost of messages , 1988, PODC '88.

[12] Brian A. Coan,et al. Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity , 1992, Inf. Comput..