Computer Science

Exact byzantine consensus on arbitrary directed graphs under local broadcast model

Document Type

Conference Paper

Abstract

We consider Byzantine consensus in a synchronous system where nodes are connected by a network modeled as a directed graph, i.e., communication links between neighboring nodes are not necessarily bi-directional. The directed graph model is motivated by wireless networks wherein asymmetric communication links can occur. In the classical point-to-point communication model, a message sent on a communication link is private between the two nodes on the link. This allows a Byzantine faulty node to equivocate, i.e., send inconsistent information to its neighbors. This paper considers the local broadcast model of communication, wherein transmission by a node is received identically by all of its outgoing neighbors, effectively depriving the faulty nodes of the ability to equivocate. Prior work has obtained sufficient and necessary conditions on undirected graphs to be able to achieve Byzantine consensus under the local broadcast model. In this paper, we obtain tight conditions on directed graphs to be able to achieve Byzantine consensus with binary inputs under the local broadcast model. The results obtained in the paper provide insights into the trade-off between directionality of communication links and the ability to achieve consensus.

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs

Publication Date

2020

Volume

153

ISSN

1868-8969

ISBN

9783959771337

DOI

10.4230/LIPIcs.OPODIS.2019.30

APA Citation

Khan, M. S., Tseng, L., & Vaidya, N. H. (2019). Exact Byzantine consensus on arbitrary directed graphs under local broadcast model. arXiv preprint arXiv:1911.07298.

Link to Full Text

Share

COinS