Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks
Bouzid, Zohir · Potop-Butucaru, Maria · Tixeuil, Sébastien
Original · EN
We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f+1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimensional space.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.