Self-Stabilizing Byzantine Asynchronous Unison

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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00437691
Contributor : Swan Dubois <>
Submitted on : Tuesday, December 1, 2009 - 11:30:03 AM
Last modification on : Thursday, August 22, 2019 - 1:09:30 AM
Long-term archiving on : Thursday, June 17, 2010 - 8:22:27 PM

Files

DGNT09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00437691, version 1
  • ARXIV : 0912.0134

Citation

Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikhail Nesterenko, Sébastien Tixeuil. Self-Stabilizing Byzantine Asynchronous Unison. [Research Report] 2009, pp.15. ⟨inria-00437691⟩

Share

Metrics

Record views

364

Files downloads

283