A novel approach to overcome network failure

A distributed network can have faulty links and nodes. In such a case, reaching a decision amongst themselves become extremely difficult. The current work describes an effective solution for reaching an agreement in a distributed system in the presence of such faults. Furthermore, a partitioning method is used to reduce the overhead of exchanging messages.

[1]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[2]  Kuo-Qin Yan,et al.  An Optimal Solution for Consensus Problem in an Unreliable Communications System , 1988, ICPP.

[3]  Philip M. Thambidurai,et al.  Interactive consistency with multiple failure modes , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[4]  Eric Rémila,et al.  Algorithms for Leader Election by Cellular Automata , 2001, J. Algorithms.

[5]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[6]  Shu-Chin Wang,et al.  Revisit consensus problem on dual link failure modes , 1998, Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241).