Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links

Traditionally, the problems of Byzantine agreement, consensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are reexamined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure, link failure, or processor and link failure. >

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

[2]  Özalp Babaoglu,et al.  On the reliability of consensus-based fault-tolerant distributed computing systems , 1987, TOCS.

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

[4]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[6]  Rüdiger Reischuk,et al.  A New Solution for the Byzantine Generals Problem , 1985, Inf. Control..

[7]  Özalp Babaoglu,et al.  Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts , 1985, IEEE Transactions on Software Engineering.

[8]  Bruce M. McMillin,et al.  Byzantine fault-tolerance through application oriented specification , 1987 .

[9]  Greg Thiel,et al.  LOCUS a network transparent, high reliability distributed system , 1981, SOSP.

[10]  J. Goldberg,et al.  SIFT: Design and analysis of a fault-tolerant computer for aircraft control , 1978, Proceedings of the IEEE.

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

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

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

[14]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[15]  Kuo-Qin Yan,et al.  An Optimal Solution for Consensus Problem in an Unreliable Communications System , 1988, ICPP.

[16]  Sam Toueg,et al.  Optimal clock synchronization , 1985, PODC '85.

[17]  Richard C. T. Lee,et al.  The Propositional Logic , 1973 .

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

[19]  Brian A. Coan,et al.  Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..

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

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

[22]  Sam Toueg,et al.  Fast Distributed Agreement , 1987, SIAM J. Comput..

[23]  Paul D. Ezhilchelvan,et al.  Early Stopping Algorithms for Distributed Agreement under Fail-Stop, Omission, and Timing Fault-Types , 1987, SRDS.

[24]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[25]  Hermann Kopetz,et al.  Clock Synchronization in Distributed Real-Time Systems , 1987, IEEE Transactions on Computers.