This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Randomized Byzantine Agreement
June 1985 (vol. 11 no. 6)
pp. 539-546
K.J. Perry, I. B. M. Thomas J. Watson Research Center
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.
Index Terms:
reliability, Distributed computing, distributed database systems, fault-tolerance, protocols
Citation:
K.J. Perry, "Randomized Byzantine Agreement," IEEE Transactions on Software Engineering, vol. 11, no. 6, pp. 539-546, June 1985, doi:10.1109/TSE.1985.232246
Usage of this product signifies your acceptance of the Terms of Use.