Issue No. 04 - April (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.372796
<p><it>Abstract—</it>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.</p>
K. Q. Yan, S. C. Wang and Y. H. Chin, "Byzantine Agreement in a Generalized Connected Network," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 420-427, 1995.