Distributed Agreement in the Presence of Processor and Communication Faults
| dc.contributor.author | Perry, Kenneth J. | en_US |
| dc.contributor.author | Toueg, Sam | en_US |
| dc.date.accessioned | 2007-04-23T16:51:34Z | |
| dc.date.available | 2007-04-23T16:51:34Z | |
| dc.date.issued | 1984-05 | en_US |
| dc.description.abstract | 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 under-estimate resiliency when faults in the communication medium are considered; the model of this paper is more accurate in this regard. | en_US |
| dc.format.extent | 1208902 bytes | |
| dc.format.extent | 500711 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-610 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6450 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Distributed Agreement in the Presence of Processor and Communication Faults | en_US |
| dc.type | technical report | en_US |