Revisit consensus problem on dual link failure modes

Traditionally, the consensus problem was solved in a fully connected network with node failure assumption. The link failure was unfairly treated as node failure. The paper revisits the consensus problem with the assumption of link failure on dormant faults and malicious faults. A simple and efficient protocol is proposed. The complexity of information exchange required by the protocol is O(n² ). The protocol uses a minimum number of rounds to achieve a consensus and can tolerate a maximum number of allowable faulty components