Issue No. 03 - March (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.491575
<p><b>Abstract</b>—Meyer and Pradhan proposed the <it>MS</it> (for "mixed-sum") algorithm to solve the Byzantine Agreement (BA) problem with <it>dual failure modes</it>: <it>arbitrary faults</it> (Byzantine faults) and <it>dormant faults</it> (essentially omission faults and timing faults) [<ref rid="bibl02253" type="bib">3</ref>]. Our study indicates that this algorithm uses an inappropriate method to eliminate the effects of dormant faults and that the bound on the number of allowable faulty processors is overestimated. This paper corrects the algorithm and gives a new bound for the allowable faulty processors.</p>
Byzantine Agreement, consensus problem, distributed systems, dual failure modes, fault tolerance, hybrid fault model.
Yeh-Hao Chin, Hin-Sing Siu, Wei-Pang Yang, "A Note on Consensus on Dual Failure Modes", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 225-230, March 1996, doi:10.1109/71.491575