Self-stabilizing Byzantine Asynchronous Unison - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Self-stabilizing Byzantine Asynchronous Unison


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.

Dates and versions

inria-00627771 , version 1 (29-09-2011)



Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikhail Nesterenko, Sébastien Tixeuil. Self-stabilizing Byzantine Asynchronous Unison. OPODIS 2010 - 14th International Conference On Principles Of DIstributed Systems, Dec 2010, Tozeur, Tunisia. pp.83-86, ⟨10.1007/978-3-642-17653-1_7⟩. ⟨inria-00627771⟩
127 View
0 Download



Gmail Facebook Twitter LinkedIn More