Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
复制标题
换档:动态改变算法以加快达成拜占庭协议
DOI:
10.1145/41840.41844
复制
发表时间:
1987
影响因子:
2.5
通讯作者:
H. Strong
中科院分区:
文献类型:
--
作者:
A. Bar;Danny Dolev;C. Dwork;H. Strong
We describe several new algorithms for Byzantine agreement . The first of-these is a simplification of the original exponential-time Byzantine agreement algorithm due to Pease, Shostak, and Lamport, and is of comparable complexity to their algorithm . However, its proof is very intuitively appealing . A technique of shifting between algorithms for solving the Byzantine agreement problem is then studied . We present two families of algorithms obtained by applying a shift operator to our first algorithm . These families obtain the same rounds to message length trade-off as do Coan's families but do not require the exponential local computation time (and space of his algorithms . We also describe a modification of an O(/ )-resilient algorithm for Byzantine agreement of Dolev, Reischuk, and Strong . Finally, we obtain a hybrid algorithm that dominates all our others, by beginning execution of an algorithm in one family and shifting first into an algorithm of the second family and finally shifting into an execution of the adaptation of the Dolev, Reischuk, and Strong algorithm . 0 `IBM T. J. Watson Research Center, P . 0. Box 704, Yorktown Heights, NY 10598. This work was carried out while this author was a Ph .D . student of the Hebrew University, Jerusalem, Israel . tIBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120 and the Computer Science Department, Hebrew University, Jerusalem, Israel . $IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120 . §IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120 .