Self-stabilizing Byzantine Asynchronous Unison

Swan Dubois 1 Maria Gradinariu Potop-Butucaru 1 Mikhail Nesterenko 2 Sébastien Tixeuil 3, 4, 5
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
3 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
5 GRAND-LARGE - Global parallel and distributed computing
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LIFL - Laboratoire d'Informatique Fondamentale de Lille, LRI - Laboratoire de Recherche en Informatique
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

https://hal.inria.fr/inria-00627771
Contributor : Swan Dubois <>
Submitted on : Thursday, September 29, 2011 - 3:25:13 PM
Last modification on : Wednesday, August 21, 2019 - 12:12:04 PM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

238