JavaScript is disabled for your browser. Some features of this site may not work without it.
Simple and Efficient Byzantine General Algorithms with Early Stopping

Author
Toueg, Sam; Perry, Kenneth J.; Srikanth, T. K.
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.
Date Issued
1984-07Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-621
Type
technical report