Brief announcement: Crash-tolerant consensus in directed graph revisited

Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2017) Brief announcement: Crash-tolerant consensus in directed graph revisited. In: 31st International Symposium on Distributed Computing, DISC 2017, 16 - 20 October 2017, Vienna.

PDF DISC 2017_91_2017 .pdf - Published Version Restricted to Registered users only Download (348kB) | Request a copy

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. © Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, and Pratik Sarkar;.

Item Type:	Conference Paper
Publication:	Leibniz International Proceedings in Informatics, LIPIcs
Publisher:	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Additional Information:	The copyright for this article belongs to the Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
Keywords:	Connectors (structural); Distributed computer systems, Communication complexity; Communication rounds; Consensus; Consensus protocols; Crash failures; Distributed consensus; Optimal number; Round complexity, Directed graphs
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	17 Jul 2022 05:37
Last Modified:	17 Jul 2022 05:37
URI:	https://eprints.iisc.ac.in/id/eprint/74475

Actions (login required)

View Item