ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Crash-tolerant consensus in directed graph revisited (Extended abstract)

Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2018) Crash-tolerant consensus in directed graph revisited (Extended abstract). In: 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, 18 - 21 June 2018, Ma’ale HaHamisha, pp. 55-71.

Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-3-030-01325-7_10


Fault-tolerant distributed consensus is a fundamental problem in secure distributed computing. In this work, we consider the problem of distributed consensus in directed graphs tolerating crash failures. Tseng and Vaidya (PODC’15) presented necessary and sufficient condition for the existence of consensus protocols in directed graphs. We improve the round and communication complexity of their protocol. Moreover, we prove that our protocol requires the optimal number of communication rounds, required by any protocol belonging to a restricted class of crash-tolerant consensus protocols in directed graphs.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
Additional Information: The copyright for this article belongs to the Springer Verlag.
Keywords: Computational complexity; Connectors (structural); Distributed computer systems, Communication complexity; Communication rounds; Consensus; Consensus protocols; Distributed consensus; Extended abstracts; Fault-tolerant; Round complexity, Directed graphs
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 18 Aug 2022 05:50
Last Modified: 18 Aug 2022 05:50
URI: https://eprints.iisc.ac.in/id/eprint/75947

Actions (login required)

View Item View Item