Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited

Authors Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar

Thumbnail PDF


  • Filesize: 340 kB
  • 4 pages

Document Identifiers

Author Details

Ashish Choudhury
Gayathri Garimella
Arpita Patra
Divya Ravi
Pratik Sarkar

Cite AsGet BibTex

Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, and Pratik Sarkar. Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 46:1-46:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


We revisit the problem of distributed consensus in directed graphs tolerating crash failures; we improve the round and communication complexity of the existing protocols. Moreover, we prove that our protocol requires the optimal number of communication rounds, required by any protocol belonging to a specific class of crash-tolerant consensus protocols in directed graphs.
  • Directed graph
  • Consensus
  • Crash failure
  • Round complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulation and Advanced Topics. Wiley series on Parallel and Distributed Computing, 2004. Google Scholar
  2. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996. Google Scholar
  3. M. Pease, R. E. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. JACM, 27(2):228-234, 1980. Google Scholar
  4. L. Tseng. Recent Results on Fault-Tolerant Consensus in Message-Passing Networks. In SIROCCO, volume 9988 of Lecture Notes in Computer Science, pages 92-108, 2016. Google Scholar
  5. L. Tseng and N. H. Vaidya. Crash-Tolerant Consensus in Directed Graphs. CoRR, abs/1412.8532, 2014. Full version appeared in PODC 2015. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail