License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2021.26
URN: urn:nbn:de:0030-drops-148285
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14828/
Khan, Muhammad Samir ;
Vaidya, Nitin H.
Byzantine Consensus with Local Multicast Channels
Abstract
Byzantine consensus is a classical problem in distributed computing. Each node in a synchronous system starts with a binary input. The goal is to reach agreement in the presence of Byzantine faulty nodes. We consider the setting where communication between nodes is modelled via an undirected communication graph. In the classical point-to-point communication model all messages sent on an edge are private between the two endpoints of the edge. This allows a faulty node to equivocate, i.e., lie differently to its different neighbors. Different models have been proposed in the literature that weaken equivocation. In the local broadcast model, every message transmitted by a node is received identically and correctly by all of its neighbors. In the hypergraph model, every message transmitted by a node on a hyperedge is received identically and correctly by all nodes on the hyperedge. Tight network conditions are known for each of the three cases.
We introduce a more general model that encompasses all three of these models. In the local multicast model, each node u has one or more local multicast channels. Each channel consists of multiple neighbors of u in the communication graph. When node u sends a message on a channel, it is received identically by all of its neighbors on the channel. For this model, we identify tight network conditions for consensus. We observe how the local multicast model reduces to each of the three models above under specific conditions. In each of the three cases, we relate our network condition to the corresponding known tight conditions. The local multicast model also encompasses other practical network models of interest that have not been explored previously, as elaborated in the paper.
BibTeX - Entry
@InProceedings{khan_et_al:LIPIcs.DISC.2021.26,
author = {Khan, Muhammad Samir and Vaidya, Nitin H.},
title = {{Byzantine Consensus with Local Multicast Channels}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14828},
URN = {urn:nbn:de:0030-drops-148285},
doi = {10.4230/LIPIcs.DISC.2021.26},
annote = {Keywords: Byzantine fault, distributed algorithm, consensus, broadcast, multicast}
}
|
Keywords: |
|
Byzantine fault, distributed algorithm, consensus, broadcast, multicast |
|
Collection: |
|
35th International Symposium on Distributed Computing (DISC 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
04.10.2021 |
