License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2019.45
URN: urn:nbn:de:0030-drops-113528
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11352/
Go to the corresponding LIPIcs Volume Portal


Hellings, Jelle ; Sadoghi, Mohammad

Brief Announcement: The Fault-Tolerant Cluster-Sending Problem

pdf-format:
LIPIcs-DISC-2019-45.pdf (0.4 MB)


Abstract

The development of fault-tolerant distributed systems that can tolerate Byzantine behavior has traditionally been focused on consensus protocols, which support fully-replicated designs. For the development of more sophisticated high-performance Byzantine distributed systems, more specialized fault-tolerant communication primitives are necessary, however. In this brief announcement, we identify the cluster-sending problem - the problem of sending a message from one Byzantine cluster to another Byzantine cluster in a reliable manner - as such an essential communication primitive. We not only formalize this fundamental problem, but also establish lower bounds on the complexity of this problem under crash failures and Byzantine failures. Furthermore, we develop practical cluster-sending protocols that meet these lower bounds and, hence, have optimal complexity. As such, our work provides a strong foundation for the further exploration of novel designs that address challenges encountered in fault-tolerant distributed systems.

BibTeX - Entry

@InProceedings{hellings_et_al:LIPIcs:2019:11352,
  author =	{Jelle Hellings and Mohammad Sadoghi},
  title =	{{Brief Announcement: The Fault-Tolerant Cluster-Sending Problem}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{45:1--45:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Jukka Suomela},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11352},
  URN =		{urn:nbn:de:0030-drops-113528},
  doi =		{10.4230/LIPIcs.DISC.2019.45},
  annote =	{Keywords: Byzantine clusters, message sending, lower bound, optimal protocol}
}

Keywords: Byzantine clusters, message sending, lower bound, optimal protocol
Seminar: 33rd International Symposium on Distributed Computing (DISC 2019)
Issue Date: 2019
Date of publication: 11.10.2019


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