A Scalable Byzantine Grid
Alexandre Maurer (LIP6, LINCS), S\'ebastien Tixeuil (LIP6, LINCS, IUF)

TL;DR
This paper introduces a scalable broadcast protocol for large grid networks that tolerates increasing Byzantine failures and maintains reliable communication despite node misbehavior.
Contribution
It presents the first broadcast protocol that scales with network size, tolerates more Byzantine failures, and supports a constant Byzantine ratio in large grids.
Findings
Number of tolerable Byzantine failures increases with network size.
Protocol maintains reliable broadcast despite Byzantine node presence.
Scalability demonstrated in ultra-large grid networks.
Abstract
Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees when the number of nodes keeps increasing unboundedly ? To be more specific, we consider the problem or reliably broadcasting information on an asynchronous grid in the presence of Byzantine failures -- that is, some nodes may have an arbitrary and potentially malicious behavior. Our requirement is that a constant fraction of correct nodes remain able to achieve reliable communication. Existing solutions can only tolerate a fixed number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
