Chandra–Toueg consensus algorithm

The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving <a href="/facts/Consensus_(computer_science)/rC0eH88V">consensus</a> in a network of unreliable processes equipped with an eventually strong <a href="/facts/Failure_detector/8kLcaEeR">failure detector</a>. The failure detector is an abstract version of <a href="/facts/Timeout_(computing)/va8CczEQ">timeouts</a>; it signals to each process when other processes may have crashed. An eventually strong failure detector is one that never identifies some specific non-faulty process as having failed after some initial period of confusion, and, at the same time, eventually identifies all faulty processes as failed (where a faulty process is a process which eventually fails or crashes and a non-faulty process never fails). The Chandra–Toueg consensus algorithm assumes that the number of faulty processes, denoted by f, is less than n/2 (i.e. the minority), i.e. it assumes f < n/2, where n is the total number of processes.

Chandra–Toueg consensus algorithm open-in-new

Chandra–Toueg consensus algorithm