We define a new model for algorithms to reach Byzantine Agreement. It allows to measure the complexity more accurately, to differentiate between processor faults and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2f+4 in the worst case, where f is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Also its average performance can easily be analysed making realistic assumptions on random distributions of faults. We show that it stops with high probability after a small number of phases.
CITATION STYLE
Reischuk, R. K. (1983). A new solution for the Byzantine generals problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 158 LNCS, pp. 382–393). Springer Verlag. https://doi.org/10.1007/3-540-12689-9_120
Mendeley helps you to discover research relevant for your work.