Maximum Metric Spanning Tree made Byzantine Tolerant - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Maximum Metric Spanning Tree made Byzantine Tolerant


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. This paper focus on systems that are both self-stabilizing and Byzantine tolerant. We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we provide first two impossibility results about the construction of maximum metric tree in presence of transients and (permanent) Byzantine faults. Then, we provide a new self-stabilizing protocol that provides optimal containment of an arbitrary number of Byzantine faults.
Fichier principal
Vignette du fichier
DuboisMasuzawaTixeuil.pdf (401.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00589234 , version 1 (28-04-2011)


  • HAL Id : inria-00589234 , version 1
  • ARXIV : 1104.5368


Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. Maximum Metric Spanning Tree made Byzantine Tolerant. [Research Report] ???. 2011, pp.32. ⟨inria-00589234⟩
180 View
163 Download



Gmail Facebook X LinkedIn More