Crash-Tolerant Consensus in Directed Graphs
Lewis Tseng, Nitin Vaidya
TL;DR
This paper establishes the exact conditions on directed network graphs needed for achieving crash-tolerant consensus among nodes in both synchronous and asynchronous systems.
Contribution
It provides the first tight necessary and sufficient graph conditions for crash-tolerant consensus in directed networks.
Findings
Identifies precise graph conditions for consensus under crash faults.
Applies results to both synchronous and asynchronous systems.
Enhances understanding of fault-tolerant distributed computing.
Abstract
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Opportunistic and Delay-Tolerant Networks · Interconnection Networks and Systems