Self-Stabilizing Byzantine Asynchronous Unison
Swan Dubois (LIP6, INRIA Rocquencourt), Maria Gradinariu, Potop-Butucaru (LIP6, INRIA Rocquencourt), Mikhail Nesterenko, S\'ebastien, Tixeuil (LIP6)
TL;DR
This paper presents a self-stabilizing algorithm for asynchronous unison in systems with Byzantine faults, achieving optimal stabilization time and minimal containment radius for chain and ring topologies.
Contribution
It introduces the first self-stabilizing Byzantine-tolerant solution for asynchronous unison in chain and ring topologies with optimal properties.
Findings
Solution works for chain and ring topologies.
Achieves minimum containment radius.
Provides optimal stabilization time.
Abstract
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm has minimum possible containment radius and optimal stabilization time.
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
TopicsDistributed systems and fault tolerance · Cryptography and Data Security · Advanced Data Storage Technologies