Reaching Approximate Agreement in the Presence of Faults
Name
MIT-LCS-TM-276.pdf
Size
4.95 MB
Format
Adobe PDF
Checksum (MD5)
e2a107f8f27d603308dd1967beff6ad1
Author(s)
Dolev, Danny
Lynch, Nancy A.
Pinter, Shlomit S.
Stark, Eugene W.
Weihl, William E.
Date Issued
May 1985
Series/Report no.
MIT-LCS-TM-276
Abstract
This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Booleann values or values from some bounded range, and in which approximate, rather than exact, agreement is the desired goal. Algorithms are presented to reach approximate agreement in aynchronous, as well as synchornous systems. The asynchronous agreement algorithm is an interesting contrast to a result of Fischer, Lynch, and Paterson, who show that exact agreement is not attainable in an asychronous system with as few as one fault process. The algorithms work by successive approximation, with a provable convergence rate that depends on the ratio between the number of faulty processes and the total number of processes. Lower bounds on the convergence rate for algorithms of this form are proven, and the algorithms presented are shown to be optimal.
Persistent DSpace Link
