Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited

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

doi:10.4230/LIPIcs.DISC.2017.46

Document

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited

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

Part of: Volume: 31st International Symposium on Distributed Computing (DISC 2017)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Symposium on Distributed Computing (DISC)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2017-10-12

PDF

File

LIPIcs.DISC.2017.46.pdf

Filesize: 340 kB
4 pages

Document Identifiers

DOI: 10.4230/LIPIcs.DISC.2017.46
URN: urn:nbn:de:0030-drops-79784

Author Details

Ashish Choudhury

Gayathri Garimella

Arpita Patra

Divya Ravi

Pratik Sarkar

Cite As Get 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) https://doi.org/10.4230/LIPIcs.DISC.2017.46

Abstract

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.

Subject Classification

Keywords

Directed graph
Consensus
Crash failure
Round complexity

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

References

H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulation and Advanced Topics. Wiley series on Parallel and Distributed Computing, 2004.
N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
M. Pease, R. E. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. JACM, 27(2):228-234, 1980.
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.
L. Tseng and N. H. Vaidya. Crash-Tolerant Consensus in Directed Graphs. CoRR, abs/1412.8532, 2014. Full version appeared in PODC 2015.

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