English

Crash-Tolerant Consensus in Directed Graphs

Distributed, Parallel, and Cluster Computing 2015-01-05 v2

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

Keywords

Cite

@article{arxiv.1412.8532,
  title  = {Crash-Tolerant Consensus in Directed Graphs},
  author = {Lewis Tseng and Nitin Vaidya},
  journal= {arXiv preprint arXiv:1412.8532},
  year   = {2015}
}
R2 v1 2026-06-22T07:46:34.899Z