This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Degradable Byzantine Agreement
January 1995 (vol. 44 no. 1)
pp. 146-150

Abstract—Traditional Byzantine agreement protocols require all fault-free receivers to agree on an identical value. The proposed degradable agreement approach achieves traditional agreement up to m faults and a degraded form of agreement up to u faults (u\geq m), which allows fault-free receivers to agree on at most two different values (one of which is necessarily the default value). A degradable agreement algorithm and lower bounds are presented.

Index Terms—Byzantine agreement, clock synchronization, degradation, malicious faults, fault tolerance.

[1] D. Dolev,“The Byzantine generals strike again,”J. Algorithm, pp. 14–30, 1982.
[2] D. Dolev, J. Y. Halpern, and H. R. Strong,“On the possibility and impossibility of achieving clock synchronization,”J. Comput. and Syst. Sci., vol. 32, pp. 230–250, 1986.
[3] R. E. Harper, J. H. Lala, and J. J. Deyst,“Fault tolerant parallel processor architecture overview,”inDig. of Papers: The 18th Int. Symp. Fault-Tolerant Computat.1988, pp. 252–257.
[4] C. M. Krishna and I. S. Bhandari,“On graceful degradation of phase locked clocks,”inIEEE Real-Time Syst. Symp., 1988, pp. 202–211.
[5] L. Lamport,“The weak Byzantine generals problem,”J. ACM, vol. 30, pp. 668–676, July 1983.
[6] 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.
[7] J. F. Paris,“Voting with witnesses: A consistency scheme for replicated files,”inInt. Conf. Distrib. Computing Syst.1986, pp. 606–612.
[8] T.B. Smith, The Fault-Tolerant Multiprocessor Computer. Park Ridge, N.J.: Noyes Publications, 1986.
[9] T. K. Srikanth and S. Toueg,“Optimal clock synchronization,”J. ACM, pp. 626–645, July 1987.
[10] N. H. Vaidya,“Degradable agreement with hybrid faults (an algorithm and reliability-safety analysis),”Tech. Rep. 93-037, Comput. Sci. Dep., Texas A&M Univ., College Station, TX, College Station, TX, Aug. 1993.
[11] N. H. Vaidya and D. K. Pradhan,“Degradable agreement in the presence of Byzantine faults,”inInt. Conf. Distrib. Computing Syst.May 1993, pp. 237–244.
[12] ——,“Degradable Byzantine agreement,”Tech. Rep. 93-015, Comput. Sci. Dep., Texas A&M Univ., Mar. 1993. (supercedes report #92-020 by N. H. Vaidya.).
[13] N. H. Vaidya,“Degradable agreement in the presence of Byzantine faults,”Tech. Rep. 92–020, Comput. Sci. Dep., Texas A&M Univ., 1992.

Citation:
Nitin H. Vaidya, Dhiraj K. Pradhan, "Degradable Byzantine Agreement," IEEE Transactions on Computers, vol. 44, no. 1, pp. 146-150, Jan. 1995, doi:10.1109/12.367999
Usage of this product signifies your acceptance of the Terms of Use.