This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Consensus With Dual Failure Modes
April 1991 (vol. 2 no. 2)
pp. 214-222

The problem of achieving consensus in a distributed system is discussed. Systems aretreated in which either or both of two types of faults may occur: dormant (essentiallyomission and timing faults) and arbitrary (exhibiting arbitrary behavior, commonly referred to as Byzantine). Previous results showed that are number of dormant faults may be tolerated when there are no arbitrary faults and that, at most, (n-1/3) arbitrary faults may be tolerated when there are no dormant faults (n is the number of processors). Acontinuum is established between the previous results: an algorithm exists if n(f/submax/+2m/sub max/) and c(f/sub max/+m/sub max/) (where c is the system connectivity),when faults are constrained so that there are at most f/sub max/ and at most m/submax/ of these that are arbitrary. An algorithm is given and compared to known algorithms. A method is given to establish virtual links so that the communications graph appears completely connected.

[1] F. Cristian, H. Aghili, H. R. Strong, and D. Dolev, "Atomic broadcast: From simple message diffusion to Byzantine agreement," inProc. 15th Fault-Tolerant Comput. Symp., Ann Arbor, MI, 1985, pp. 200-205.
[2] W. Diffie and M. Hellman, "New directions in cryptography,"IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, 1976.
[3] D. Dolev, "The Byzantine generals strike again,"J. Algorithms, vol. 3, pp. 14-30, 1982.
[4] D. Dolev, M. J. Fischer, R. Fowler, N. A. Lynch, and H. R. Strong, "An efficient algorithm for Byzantine agreement without authentication,"Inform. Contr., no. 52, pp. 257-274, 1982.
[5] D. Dolev and H. R. Strong, "Authenticated algorithms for Byzantine agreement,"SIAM J. Comput., vol. 12, no. 4, pp. 656-666, Nov. 1983.
[6] A. L. Hopkins, Jr., T. B. Smith III, and J. H. Lala, "FTMPA highly reliable fault-tolerant multiprocessor for aircraft,"Proc. IEEE, vol. 66, no. 10, pp. 1221-1239, Oct. 1978.
[7] 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.
[8] L. Lamport, "The weak Byzantine generals problem,"J. ACM, vol. 30, no. 3, pp. 668-676, July 1983.
[9] 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.
[10] T. K. Srikanth and S. Toueg, "Optimal clock synchronization,"Distributed Comput., vol. 2, pp. 80-94, 1987.
[11] P. Thambidurai and Y.-K. Park, "Interactive consistency with multiple failure modes," inProc. Symp. on Reliable Dist. Syst., Oct. 1988, pp. 93-100.

Index Terms:
Index Termsconsensus; distributed system; arbitrary behavior; Byzantine; dormant faults; arbitraryfaults; communications graph; distributed processing; fault tolerant computing
Citation:
F.J. Meyer, D.K. Pradhan, "Consensus With Dual Failure Modes," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, pp. 214-222, April 1991, doi:10.1109/71.89066
Usage of this product signifies your acceptance of the Terms of Use.