Degradable Byzantine agreement

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/spl ges/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. >

[1]  Jehan-François Pâris,et al.  Voting with Witnesses: A Constistency Scheme for Replicated Files , 1986, ICDCS.

[2]  Danny Dolev,et al.  On the Possibility and Impossibility of Achieving Clock Synchronization , 1986, J. Comput. Syst. Sci..

[3]  T Basil Smith.  The fault-tolerant multiprocessor computer , 1986 .

[4]  Jaynarayan H. Lala,et al.  Fault tolerant parallel processor architecture overview , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[5]  Danny Dolev,et al.  On the possibility and impossibility of achieving clock synchronization , 1984, STOC '84.

[6]  Dhiraj K. Pradhan,et al.  Degradable agreement in the presence of Byzantine faults , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[7]  Sam Toueg,et al.  Optimal clock synchronization , 1985, PODC '85.

[8]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[9]  Leslie Lamport,et al.  The Weak Byzantine Generals Problem , 1983, JACM.

[10]  Robert S. Swarz,et al.  The theory and practice of reliable system design , 1982 .

[11]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[12]  Inderpal S. Bhandari,et al.  On the graceful degradation of phase-locked clocks , 1988, Proceedings. Real-Time Systems Symposium.

[13]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.