论文信息 - Crash-Tolerant Consensus in Directed Graphs

Crash-Tolerant Consensus in Directed Graphs

This work considers a point-to-point network of n nodes connected by directed links, and proves tight necessary and sufficient conditions on the underlying communication graphs for achieving consensus among these nodes under crash faults. We identify the conditions in both synchronous and asynchronous systems

Lewis Tseng | Nitin H. Vaidya | N. Vaidya | Lewis Tseng

[1] Rachid Guerraoui,et al. What Can Be Implemented Anonymously? , 2005, DISC.

[2] Lewis Tseng,et al. Asynchronous convex hull consensus in the presence of crash faults , 2014, PODC '14.

[3] Matthias Függer,et al. Approximate Consensus in Highly Dynamic Networks , 2014, ArXiv.

[4] Nancy A. Lynch,et al. Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[5] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.

[6] Carole Delporte-Gallet,et al. Fault-Tolerant Consensus in Unknown and Anonymous Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[7] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.

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

[9] Lewis Tseng,et al. Exact Byzantine Consensus in Directed Graphs , 2012, ArXiv.

[10] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.

[11] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[12] Idit Keidar,et al. Impossibility Results and Lower Bounds for Consensus under Link Failures , 2008, SIAM J. Comput..

[13] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.