Byzantine Agreement in a Generalized Connected Network

Traditionally, the Byzantine Agreement (BA) problem is studied either in a fully connected network or in a broadcast network. A generalized network model for BA is proposed in this paper. A fully-connected network or a broadcast network is a special case of the new network architecture. Under the new generalized network model, the BA problem is reexamined with the assumption of malicious faults on both processors and transmission medium (TM), as opposed to previous studies which consider malicious faults on processors only. The proposed algorithm uses the minimum number of message exchanges, and can tolerate the maximum number of allowable faulty components to make each healthy processor reach a common agreement for the cases of processor failures, TM failures, or processor/TM failures. The results can also be used to solve the interactive consistency problem and the consensus problem. >

[1]  Özalp Babaoglu,et al.  Reliable broadcasts and communication models: tradeoffs and lower bounds , 1988, Distributed Computing.

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

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

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

[5]  Y. H. Chin,et al.  Achieving Byzantine agreement in a generalized network model , 1989, Proceedings. VLSI and Computer Peripherals. COMPEURO 89.

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

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

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

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

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

[11]  William Stallings,et al.  Data and Computer Communications , 1985 .

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

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

[14]  K.Q. Yan,et al.  Achieving Byzantine agreement in a processor and link fallible network , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

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

[16]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .