This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
April 1998 (vol. 9 no. 4)
pp. 335-345

Abstract—In early stage, the Byzantine agreement (BA) problem was studied with single faults on processors in either a fully connected network or a nonfully connected network. Subsequently, the single fault assumption was extended to mixed faults (also referred to as hybrid fault model) on processors. For the case of both processor and link failures, the problem has been examined in a fully connected network with a single faulty type, namely an arbitrary fault. To release the limitations of a fully connected network and a single faulty type, the problem is reconsidered in a general network. The processors and links in such a network can both be subjected to different types of fault simultaneously. The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement.

[1] J.C. Adams and K.V.S. Ramarao, "Distributed Diagnosis of Byzantine Processors and Links," Proc. Symp. Distributed Computing Systems, pp. 562-569, 1989.
[2] O. Babaoglu, "On the Reliability of Consensus-Based Fault-Tolerant Distributed Computing Systems," ACM Trans. Computer Systems, vol. 5, no. 2, pp. 394-416, Nov. 1987.
[3] O. Babaoglu and R. Drummond, "Street of Byzantium: Network Architectures for Fast Reliable Broadcasts," IEEE Trans. Software Eng., vol. 11, no. 6, pp. 546-554, June 1985.
[4] M.A. Barborak, M. Malek, and A.T. Dahbura, "The Consensus Problem in Fault-Tolerant Computing," ACM Computer Surveys, vol. 25, pp. 171-220, June 1993.
[5] 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.
[6] P. Berman and J.A. Garay, "Cloture Votes: n/4-Resilient Distributed Consensus in t + 1 Rounds," Math. Systems Theory, vol. 26, no. 1, pp. 3-19, 1993.
[7] F. Christian, H. Aghili, and H.R. Strong, "Atomic Broadcase: From Simple Message Diffusion to Byzantine Agreement," Proc. Symp. Fault-Tolerant Computing, pp. 200-205,Ann Arbor, Mich., 1985.
[8] N. Deo, GRAPH THEORY with Applications to Engineering and Computer Science.Englewood Cliffs, N.J.: Prentice Hall, 1974.
[9] D. Dolev, "The Byzantine Generals Strike Again," J. Algorithms, vol. 3, no. 1, pp. 14-30, 1982.
[10] D. Dolev et al., "Reaching Approximate Agreement in the Presence of Faults," J. ACM, July 1986, pp. 499-516.
[11] M. Fischer and N. Lynch, "A Lower Bound for the Assure Interactive Consistency," Information Processing Letters, vol. 14, no. 4, pp. 183-186, June 1982.
[12] M.J. Fischer, N.A. Lynch, and M.S. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374i–382, 1985.
[13] 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.
[14] P. Lincoln and J. Rushby, “A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model,” Proc. Fault Tolerant Computing Symp. 23, pp. 402–411, Toulouse, France, June 1993.
[15] J. Martin, Telecommunications and the Computer, third ed. Englewood Cliffs, N.J.: Prentice Hall, 1990.
[16] F.J. Meyer and D.K. Pradhan, "Consensus With Dual Failure Modes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 2, pp. 214-222, Apr. 1991.
[17] H.G. Molina, F. Pittelli, and S. Davidson, "Applications of Byzantine Agreement in Database Systems," ACM Trans. Database Systems, vol. 11, no. 1, pp. 27-47, Mar. 1986.
[18] 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.
[19] A. Pelc, "Reliable Communication in Networks with Byzantine Link Failures," NETWORKS, vol. 22, no. 5, pp. 441-459, Aug. 1992.
[20] V. Ramaswami and J.L. Wang, "Analysis of the Link Error Monitoring Protocols in the Common Channel Signaling Network," IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 31-47, Feb. 1993.
[21] K. Shin and P. Ramanathan, "Diagnosis of Processors with Byzantine Faults in Distributed Computing Systems," Proc. Symp. Fault-Tolerant Computing, pp. 55-60, 1987.
[22] H.S. Siu, Y.H. Chin, and W.P. Yang, "A Note on Consensus on Dual Failure Modes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 225-230, Mar. 1996.
[23] N. Suri,M. Hugue, and C. Walter,"Synchronization Issues in Real-Time Systems," Proc. IEEE: Special Issue on Real-Time Computing, vol. 82, no. 1, pp. 41-54, Jan. 1994.
[24] P.M. Thambidurai and Y.K. Park,"Interactive Consistency with Multiple Failure Modes," Proc. seventh Reliable Dist. Systems Symp., Oct. 1988.
[25] J. Turek and D. Shasha, “The Many Faces of Consensus in Distributed Systems,” Computer, vol. 25, no. 6, pp. 8-17, June 1992.
[26] K.Q. Yan and Y.H. Chin, "An Optimal Solution for Consensus Problem in an Unreliable Communication System," Proc. Int'l Conf. Parallel Processing, pp. 388-391,University Park, Pa., Aug. 1988.
[27] K.Q. Yan, Y.H. Chin, and S.C. Wang, "Optimal Agreement Protocol in Byzantine Faulty Processors and Faulty Links," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 3, pp. 266-280, June 1992.

Index Terms:
Byzantine agreement, fault-tolerant distributed system, hybrid fault model, general network, synchronization.
Citation:
Hin-Sing Siu, Yeh-Hao Chin, Wei-Pang Yang, "Byzantine Agreement in the Presence of Mixed Faults on Processors and Links," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 335-345, April 1998, doi:10.1109/71.667895
Usage of this product signifies your acceptance of the Terms of Use.