English

Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalit\'e du Protocole min+1

Distributed, Parallel, and Cluster Computing 2011-04-21 v1

Abstract

A self-stabilizing is naturally resilient to transients faults (that is, faults of finite duration). Recently, a new class of protocol appears. These protocols are self-stabilizing and are moreover resilient to a limited number of permanent faults. In this article, we interest in self-stabilizing protocols that tolerate very hard permanent faults: Byzantine faults. We introduce two new scheme of Byzantine containment in self-stabilizing systems. We show that, for the problem of BFS spanning tree construction, the well known self-stabilizing protocol min+1 provides without significant modification the best Byzantine containment with respect to these new schemes.

Keywords

Cite

@article{arxiv.1104.4022,
  title  = {Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalit\'e du Protocole min+1},
  author = {Swan Dubois and Toshimitsu Masuzawa and Sébastien Tixeuil},
  journal= {arXiv preprint arXiv:1104.4022},
  year   = {2011}
}

Comments

13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel) (2011)

R2 v1 2026-06-21T17:56:48.262Z