License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.46
URN: urn:nbn:de:0030-drops-79784
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7978/
Go to the corresponding LIPIcs Volume Portal

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

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited

pdf-format:
LIPIcs-DISC-2017-46.pdf (0.3 MB)

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.

BibTeX - Entry

@InProceedings{choudhury_et_al:LIPIcs:2017:7978,
  author =	{Ashish Choudhury and Gayathri Garimella and Arpita Patra and Divya Ravi and Pratik Sarkar},
  title =	{{Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{46:1--46:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Andr{\'e}a W. Richa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7978},
  URN =		{urn:nbn:de:0030-drops-79784},
  doi =		{10.4230/LIPIcs.DISC.2017.46},
  annote =	{Keywords: Directed graph, Consensus, Crash failure, Round complexity}
}

Keywords: Directed graph, Consensus, Crash failure, Round complexity
Collection: 31st International Symposium on Distributed Computing (DISC 2017)
Issue Date: 2017
Date of publication: 12.10.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI