This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
June 1992 (vol. 4 no. 3)
pp. 266-280

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] 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, "On the reliability of consensus-based fault-tolerant distributed computing systems,"ACM Trans. Comp. Syst., vol. 5, no. 3, pp. 394-416, Nov. 1987.
[3] A. Bar-Noyet al., "Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement," inProc. Symp. on Principles of Distributed Computing, 1987, pp. 42-51.
[4] G. Bracha and S. Toueg, "Asynchronous Consensus and broadcast protocols,"J. Ass. Comput. Mach., vol. 32, no. 4, pp. 824-840, Oct. 1985.
[5] C. L. Chang and R. C. T. Lee,Symbolic Logic Mechanical Theorem Proving. New York: Academic, 1973, ch. 2, pp. 6-23.
[6] D. Dolev, "Unanimity in an unknown and unreliable environment,"IEEE Foundations of Computer Science, pp. 159-168, 1981.
[7] D. Dolev, "The Byzantine generals strike again,"J. Algorithm, vol. 3, no. 1, pp. 14-30, 1982.
[8] D. Dolev and R. Reischuk, "Bounds on information exchange for Byzantine agreement,"J. Ass. Comput. Mach., vo.. 32, no. 1, pp. 191-204, Jan. 1985.
[9] D. Dolev and H. R. Strong, "Authenticated algorithms for Byzantine agreement,"SIAM J. Comput., vol. 12, no. 4, pp. 656-666, Nov. 1983.
[10] D. Dolev, C. Dwork, and L. Stockmeyer, "On the minimal synchronism needed for distributed consensus,"J. ACM, vol. 34, no. 1, pp. 77-97, Jan. 1987.
[11] P. D. Ezhilchelvan, "Early stopping algorithms for distributed agreement under fail-stop, omission, and time fault types," inProc. ICPP, pp. 201-212, 1987.
[12] M. Fischeret al., "A lower bound for the assure interactive consistency,"Inform. Process. Lett., vol. 14, no.. 4, pp. 183-186, June 1982.
[13] M. Fischer, "The consensus problem in unreliable distributed systems (a brief survey)," Lecture Notes in Computer Science, inProc. 1983 Int. FCT-Conf., Borgholm, Sweden, Aug. 1983, pp. 127-140.
[14] D. K. Gifford, "Weighted voting for replicated data," Tech. Rep. CSL- 79-14, Xerox palo Alto Res. Ctr., Sept. 1979.
[15] J. Gray, " Discussion of distributed systems," Res. Rep. RJ2699, IBM, Sept. 1979.
[16] H. Kopetz and W. Ochsenreiter, "Clock Synchronization in Distributed Real-Time Systems,"IEEE Trans. Computers, Vol. 36, No. 8, Aug. 1987, pp. 933-940.
[17] 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.
[18] L. Lamport and P. Melliar-Smith, "Byzantine clock synchronization," inACM 3rd PODC Conf. Proc., 1984, PP. 10-16.
[19] B. G. Lindsayet al., "Notes on distributed databases," "Res. Rep. RJ2571, IBM, July 1979.
[20] N. A. Lynch, M. J. Fischer, and R. J. Fowler, "A simple and efficient Byzantine generals algorithm," inProc. 14th ACM Symp. on Theory of Computing, 1982, pp. 46-52.
[21] B. M. McMillinet al., "Byzantine fault-tolerance through application oriented specification," inProc. COMPSASAC, 1987, pp. 347-353.
[22] M. Pease, R. Shostak, and L. Lamport, "Reaching agreement in the presence of faults,"J. Ass. Comput. Mach., vol. 27, pp. 228-234, Apr. 1980.
[23] G. Popeket al., "LOCUS: A network transparent, high reliability distributed system," inProc. 8th ACM Symp. on Operating Systems Principles, dec. 1981, pp. 169-177.
[24] R. Reischuk, "A new solution for the Byzantine generals problem," IBM Res. Rep. RJ-3673, 1982.
[25] T.K. Srikanth and S. Toueg, "Optimal Clock Synchronization,"J. ACM, Vol. 34, No. 3, July 1987, pp. 626-645.
[26] H. Stronget al., "Byzantine agreement," IBM Res. Rep. RJ-3714, 1982.
[27] S. Toeug, K. J. Perry, and T. K. Srikanth, "Fast distributed agreement,"SIAM J. Comput., vol 16, no. 3, pp. 445-457, June 1987.
[28] R. Turpin and B. Coan, "Extending binary Byzantine agreement to multivalued Byzantine agreement,"Inform. Process. Lett., vol. 18, no. 2, p. 7, Feb. 1984.
[29] J. H. Wensleyet al., "SIFT: Design and analysis of a fault-tolerant computer for aircraft control,"Proc. IEEE, vol. 66, pp. 1240-1255, Oct. 1978.
[30] K. Q. Yan and Y. H. Chin, "An optimal solution for consensus problem in an unreliable communication system," inProc. ICCP, Aug. 1988, pp. 388-391.

Index Terms:
optimal agreement protocol; fault tolerant computing; malicious faulty processors; faulty links; Byzantine agreement; consensus; interactive consistency; fault tolerant computing; protocols
Citation:
K.-Q. Yan, Y.H. Chin, S.-C. Wang, "Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 3, pp. 266-280, June 1992, doi:10.1109/69.142017
Usage of this product signifies your acceptance of the Terms of Use.