Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1

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

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00587517
Contributor : Swan Dubois <>
Submitted on : Wednesday, April 20, 2011 - 3:32:06 PM
Last modification on : Thursday, March 21, 2019 - 2:17:11 PM
Long-term archiving on : Thursday, July 21, 2011 - 2:50:07 AM

Files

Algotel11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00587517, version 1
  • ARXIV : 1104.4022

Citation

Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France. ⟨inria-00587517⟩

Share

Metrics

Record views

297

Files downloads

186