Title :
Randomized Byzantine Agreement
Author :
Perry, Kenneth J.
Author_Institution :
I. B. M. Thomas J. Watson Research Center
fDate :
6/1/1985 12:00:00 AM
Abstract :
A randomized model of distributed computation was recently presented by Rabin [ 81. This model admits a solution to the Byzantine Agreement Problem for systems of n asynchronous processes where no more than t are faulty. The algorithm described by Rabin produces agreement in an expected number of rounds which is a small constant independent of n and t. Using the same model, we present an algorithm of similar complexity which is able to tolerate a greater portion of malicious processes. The algorithm is also applicable, with minor changes, to systems of synchronous processes.
Keywords :
Distributed computing; distributed database systems; fault-tolerance; protocols; reliability; Application software; Computational modeling; Computer science; Database systems; Distributed computing; Fault tolerance; Fault tolerant systems; Indexes; Protocols; Distributed computing; distributed database systems; fault-tolerance; protocols; reliability;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1985.232246