Visiting the New Territory of Interactive Consistency
S. C. Wang, Kaiyu Yan · 朝陽學報 · 1999
Conventional, Interactive Consistency (IC) problem is revisited the IC problem with the assumption of link failure on dormant faults and malicious faults. A simple and efficient algorithm is proposed. The complexity of information exchange required by the algorithm is O(n(superscript 2)).The algorithm uses minimum number of rounds to achieve an IC and can tolerate maximum number of allowable faulty components.