Corpus ID: 14665128

Crash-Tolerant Consensus in Directed Graphs

@article{Tseng2014CrashTolerantCI,
  title={Crash-Tolerant Consensus in Directed Graphs},
  author={Lewis Tseng and Nitin H. Vaidya},
  journal={ArXiv},
  year={2014},
  volume={abs/1412.8532}
}
  • Lewis Tseng, Nitin H. Vaidya
  • Published in ArXiv 2014
  • Computer Science
  • 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 

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    Crash-tolerant Consensus in Directed Graph Revisited

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    Distributed Algorithms

    • Seif Haridi
    • Computer Science
    • Lecture Notes in Computer Science
    • 1992
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Easy impossibility proofs for distributed consensus problems

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Fault-Tolerant Consensus in Unknown and Anonymous Networks

    VIEW 1 EXCERPT

    Introduction to Graph Theory

    VIEW 2 EXCERPTS