TY - JOUR
T1 - The Byzantine generals strike again
AU - Dolev, Danny
PY - 1982/3
Y1 - 1982/3
N2 - Can unanimity be achieved in an unreliable distributed system? This problem was named the "Byzantine Generals Problem" by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.
AB - Can unanimity be achieved in an unreliable distributed system? This problem was named the "Byzantine Generals Problem" by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.
UR - http://www.scopus.com/inward/record.url?scp=0009768331&partnerID=8YFLogxK
U2 - 10.1016/0196-6774(82)90004-9
DO - 10.1016/0196-6774(82)90004-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0009768331
SN - 0196-6774
VL - 3
SP - 14
EP - 30
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 1
ER -