Byzantine Gathering in Networks
S\'ebastien Bouchard, Yoann Dieudonn\'e, Bertrand Ducourthial

TL;DR
This paper solves an open problem by determining the minimum number of good agents needed for deterministic gathering in networks with Byzantine agents, providing optimal algorithms for known and unknown network sizes.
Contribution
It provides exact bounds and optimal algorithms for gathering in the presence of Byzantine agents, considering both known and unknown network sizes.
Findings
Minimum of f+1 good agents needed when network size is known.
Minimum of f+2 good agents needed when network size is unknown.
Designed deterministic algorithms matching the proven lower bounds.
Abstract
This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the…
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.
Taxonomy
TopicsOptimization and Search Problems · Distributed systems and fault tolerance · Nanocluster Synthesis and Applications
