DocumentCode :
2188826
Title :
´Eventual´ is earlier than ´immediate´
Author :
Dolev, Danny ; Dolev, Danny ; Dolev, Danny ; Dolev, Danny ; Reischuk, Ruediger ; Reischuk, Ruediger ; Reischuk, Ruediger ; Reischuk, Ruediger ; Strong, H.Raymond ; Strong, H.Raymond ; Strong, H.Raymond ; Strong, H.Raymond
fYear :
1982
fDate :
3-5 Nov. 1982
Firstpage :
196
Lastpage :
203
Abstract :
Two different notions of Byzantine Agreement - immediate and eventually - are defined depending on whether the agreement involves an action to be performed synchronously or not. The lower bounds for time complexity depend on what kind of agreement has to be achieved. All previous algorithms to reach Byzantine Agreement ensure immediate agreement. We present two algorithms that in many cases reach the second type of agreement faster than previously known algorithms showing that there actually is a difference between the two notions: Eventual Byzantine Agreement can be reached earlier than Immediate.
Keywords :
Authentication; Laboratories; Polynomials; Stress;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
Conference_Location :
Chicago, IL, USA
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1982.51
Filename :
4568393
Link To Document :
بازگشت