The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Distributed consensus revisited
Information Processing Letters
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Consensus under unreliable transmission
Information Processing Letters
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Applied Operating System Concepts
Applied Operating System Concepts
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Computer Standards & Interfaces
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In order to achieve reliability in the distributed system, we need a mechanism to enable the system as a whole to continue to function despite the system has some faulty components. The Consensus problem is for the fault-free processors to cope with the faulty components and reach a common value from each other in the distributed system. Traditionally, the Consensus problems were solved in the synchronous network. Subsequently, Chandra and Toueg solved the Consensus problem with crash faulty processor in the asynchronous fully connected network in 1996. In this paper, we will solve the Consensus with dual failure mode (both crash fault and malicious fault) on communication links. The proposed protocol uses the minimum number of rounds of message exchange and can tolerate the maximum number of allowable faulty communication links to make each fault-free processor reach a common consensus value.