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

TL;DR

This paper explores self-stabilizing protocols resilient to Byzantine faults, introducing new containment schemes and demonstrating that the min+1 protocol offers optimal Byzantine containment for BFS spanning tree construction.

Contribution

It introduces two new Byzantine containment schemes for self-stabilizing systems and proves the optimality of the min+1 protocol under these schemes.

Findings

min+1 protocol provides optimal Byzantine containment

Two new Byzantine containment schemes are proposed

min+1 protocol is effective without significant modifications

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.