On Byzantine Containment Properties of the min+1 Protocol

Swan Dubois 1 Toshimitsu Masuzawa 2 Sébastien Tixeuil 3
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
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. %X 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01290827
Contributor : Lip6 Publications <>
Submitted on : Friday, March 18, 2016 - 4:06:59 PM
Last modification on : Thursday, March 21, 2019 - 12:59:28 PM

Links full text

Identifiers

Citation

Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. On Byzantine Containment Properties of the min+1 Protocol. 12th International Symposium Stabilization, Safety, and Security of Distributed Systems, SSS, Sep 2010, New York, NY, United States. pp.96-110, ⟨10.1007/978-3-642-16023-3_10⟩. ⟨hal-01290827⟩

Share

Metrics

Record views

347