On Byzantine Containment Properties of the $min+1$ Protocol

Abstract : Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. We consider the well known problem of constructing a breadth-first spanning tree in this context. Combining these two properties proves difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a strictly or strongly stabilizing manner. We then adopt the weaker scheme of topology-aware strict stabilization and we present a similar weakening of strong stabilization. We prove that the classical $min+1$ protocol has optimal Byzantine containment properties with respect to these criteria.
Type de document :
[Research Report] 2010
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

Contributeur : Swan Dubois <>
Soumis le : jeudi 27 mai 2010 - 21:08:24
Dernière modification le : jeudi 22 novembre 2018 - 14:16:26
Document(s) archivé(s) le : jeudi 16 septembre 2010 - 15:26:16


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00487091, version 1
  • ARXIV : 1005.5223


Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. On Byzantine Containment Properties of the $min+1$ Protocol. [Research Report] 2010. 〈inria-00487091〉



Consultations de la notice


Téléchargements de fichiers