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 a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-00934022
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, January 21, 2014 - 2:48:36 PM
Last modification on : Wednesday, May 15, 2019 - 3:54:11 AM

Identifiers

Citation

Swan Dubois, Maria Potop-Butucaru, Mikhail Nesterenko, Sébastien Tixeuil. Self-stabilizing byzantine asynchronous unison. Journal of Parallel and Distributed Computing, Elsevier, 2012, 72 (7), pp.917-923. ⟨10.1016/j.jpdc.2012.04.001⟩. ⟨hal-00934022⟩

Share

Metrics

Record views

466