This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Byzantine Agreement in a Generalized Connected Network
April 1995 (vol. 6 no. 4)
pp. 420-427

Abstract—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] O. Babaoglu and R. Drummond,“Streets of Byzantium: Network architectures for fast reliable broadcasts,”IEEE Trans. Software Eng., vol. SE-11, pp. 546–554, June 1985.
[2] O. Babaoglu, P. Stephenson, and R. Drummond,“Reliable broadcasts and communication models: Tradeoffs and lower bounds,”Dist. Computing, vol. 2, pp. 177–189, 1988.
[3] A. Bar-Noy, D. Dolev, C. Dwork, and R. Strong,“Shifting gears: Changing algorithms on the fly to expedite Byzantine Agreement,”inProc. Symp. Principles Dist. Computing, 1987, pp. 42–51.
[4] K.M. Chandy and J. Misra, Parallel Program Design—A Foundation. Addison-Wesley, 1988.
[5] D. Dolev and R. Reischuk,“Bounds on information exchange for Byzantine Agreement,”JACM, vol. 32, no. 1, pp. 191–204, Jan. 1985.
[6] D. Dolev, C. Dwork, and L. Stockmeyer, “On the Minimal Syncrhony Needed for Distributed Consensus,” J. ACM, vol. 34, no. 1, pp. 77–97, Jan. 1987.
[7] M. Fischer and N. Lynch,“A lower bound for the assure interactive consistency,”Inform. Proc. Lett., vol. 14, no. 4, pp. 183–186, June 1982.
[8] M. Fischer,“The consensus problem in unreliable distributed systems (a brief survey),”Lecture notes in computer science, inProc. 1983 Int. FCT-Con.(Borgholm, Sweden), Aug. 1983, pp. 127–140.
[9] D. K. Gifford,“Weight voting for replicated data,”Tech. Rep. CSL-79-14, XEROX, Palo Alto Res. Center, Palo Alto, CA, Sept. 1979.
[10] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. Programming Languages and Systems, vol. 4, no. 3, July 1982, pp. 382-401.
[11] B. G. Lindsayet al.,“Notes on distributed databases,”IBM Res. Rep. RJ2571, July 1979.
[12] B. M. McMillin and L. M. Ni,“Byzantine fault-tolerance through application oriented specification,”inProc. COMPASAC87, 1987, pp. 347–353.
[13] M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in the Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228–234, Apr. 1980.
[14] G. Popek,et al.,“LOCUS: A network transparent, high reliability distributed system,”inProc. 8th ACM Symp. Operating Syst. Principles, Dec. 1981, pp. 169–177.
[15] R. Reischuk,“A new solution for the Byzantine generals problem,”IBM Res. Rep., RJ-3673, Computer Science, 1982.
[16] W. Stallings,Data and Computer Communications. New York: Macmillan, 1985.
[17] T. K. Srikanth and S. Toueg,“Optimal clock synchronization,”J. ACM, pp. 626–645, July 1987.
[18] H. Strong and D. Dolev,“Byzantine Agreement,”IBM Res. Rep., RJ-3714, Computer Science, 1982.
[19] S. C. Wang, Y. H. Chin, K. Q. Yan, and C. Chen,“Achieving Byzantine Agreement in a generalized network model,”inProc. CompEuro 89, Hamburg, Germany, 1989, pp. 4.139–4.145.
[20] J. H. Wensleyet al.,“Sift: Design and analysis of a fault-tolerant computer for aircraft control,”Proc. IEEE 66, vol. 10, pp. 1240–1255, Oct. 1978.
[21] K. Q. Yan and Y. H. Chin,“Achieving Byzantine Agreement in a processor&link fallible network,”inProc. Int. Phoenix Conf. Comput., Communicat., 1989, pp. 407–412.
[22] K. Q. Yan,“A Study of Reaching Agreement in an Unreliable Communication Network,”Ph.D. dissertation, 1989, Institute of Comput. Sci., National Tsing Hua Univ., Taiwan, R.O.C.

Citation:
S. C. Wang, Y. H. Chin, K. Q. Yan, "Byzantine Agreement in a Generalized Connected Network," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 420-427, April 1995, doi:10.1109/71.372796
Usage of this product signifies your acceptance of the Terms of Use.