Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6460
Title: Simple and Efficient Byzantine General Algorithms with Early Stopping
Authors: Toueg, Sam
Perry, Kenneth J.
Srikanth, T. K.
Keywords: computer science
technical report
Issue Date: Jul-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-621
Abstract: We describe a Byzantine Agreement algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler and more efficient than those previously known. It was derived using a broadcast primitive that provides properties of message authentication and thus restricts the disruptive behavior of faulty processes. This primitive is a general tool for deriving fault-tolerant algorithms in the presence of arbitrary failures.
URI: http://hdl.handle.net/1813/6460
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-621.pdf2.15 MBAdobe PDFView/Open
84-621.ps401.3 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us