This Article 
 Bibliographic References 
 Add to: 
Distributed agreement in the presence of processor and communication faults
March 1986 (vol. 12 no. 3)
pp. 477-482
Kenneth J. Perry, IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598
Sam Toueg, Department of Computer Science, Cornell University, Ithaca, NY 14853
A model of distributed computation is proposed in which processes may fail by not sending or receiving the messages specified by a protocol. The solution to the Byzantine Generals Problem for this model is presented. Our algorithm exhibits early stopping under conditions of less than maximum failure and is as efficient as the algorithms developed for the more restrictive crash-fault model in terms of time, message, and bit complexity. We show extant models to underestimate resiliency when faults in the communication medium are considered; the model of this paper is more accurate in this regard.
Index Terms:
Protocols,Computer crashes,Complexity theory,Computational modeling,Relays,Fault tolerance,Fault tolerant systems,protocols,Byzantine agreement,distributed computing,early stopping,fault tolerance
Kenneth J. Perry, Sam Toueg, "Distributed agreement in the presence of processor and communication faults," IEEE Transactions on Software Engineering, vol. 12, no. 3, pp. 477-482, March 1986, doi:10.1109/TSE.1986.6312888
Usage of this product signifies your acceptance of the Terms of Use.