Title :
Degradable Byzantine agreement
Author :
Vaidya, Nitin H. ; Pradhan, Dhiraj K.
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fDate :
1/1/1995 12:00:00 AM
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⩾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
Keywords :
fault tolerant computing; protocols; Byzantine agreement; clock synchronization; degradable agreement; degradable agreement algorithm; degradation; fault tolerance; fault-free receivers; lower bounds; malicious faults; Clocks; Degradation; Delay estimation; Fault tolerance; Guidelines; Libraries; Multiplexing; Performance evaluation; Protocols; Synchronization;
Journal_Title :
Computers, IEEE Transactions on
