Crash-Tolerant Consensus in Directed Graphs
classification
💻 cs.DC
keywords
conditionsconsensusdirectedgraphsnodesachievingasynchronouscommunication
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.