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.2018.51
URN: urn:nbn:de:0030-drops-98405
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9840/
Go to the corresponding LIPIcs Volume Portal


Sakavalas, Dimitris ; Tseng, Lewis ; Vaidya, Nitin H.

Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus

pdf-format:
LIPIcs-DISC-2018-51.pdf (0.3 MB)


Abstract

Consider an asynchronous incomplete directed network. We study the feasibility and efficiency of approximate crash-tolerant consensus under different restrictions on topology knowledge and relay depth, i.e., the maximum number of hops any message can be relayed.

BibTeX - Entry

@InProceedings{sakavalas_et_al:LIPIcs:2018:9840,
  author =	{Dimitris Sakavalas and Lewis Tseng and Nitin H. Vaidya},
  title =	{{Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus}},
  booktitle =	{32nd International Symposium on Distributed Computing  (DISC 2018)},
  pages =	{51:1--51:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Ulrich Schmid and Josef Widder},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9840},
  URN =		{urn:nbn:de:0030-drops-98405},
  doi =		{10.4230/LIPIcs.DISC.2018.51},
  annote =	{Keywords: Asynchrony, crash fault, consensus, topology knowledge, relay}
}

Keywords: Asynchrony, crash fault, consensus, topology knowledge, relay
Collection: 32nd International Symposium on Distributed Computing (DISC 2018)
Issue Date: 2018
Date of publication: 04.10.2018


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