Mariages et Trahisons

TL;DR

This paper explores the design of self-stabilizing protocols capable of tolerating Byzantine faults, specifically focusing on constructing maximal matchings in networks with arbitrary Byzantine processes, advancing fault-tolerant distributed systems.

Contribution

It introduces methods for strict-stabilization in self-stabilizing protocols to handle an arbitrary number of Byzantine faults in network matching problems.

Findings

Protocols can achieve maximal matching despite Byzantine faults

Strict-stabilization limits the influence of Byzantine processes

New techniques enable self-stabilization with Byzantine tolerance

Abstract

A self-stabilizing protocol tolerates by definition transient faults (faults of finite duration). Recently, a new class of self-stabilizing protocols that are able to tolerate a given number of permanent faults. In this paper, we focus on self-stabilizing protocols able to tolerate Byzantine faults, that is faults that introduce an arbitrary behaviour. We focus on strict-stabilization in which the system have to contain the effects of Byzantine faults. Specificaly, we study the possibility to construct in a self-stabilizing way a maximal matching in a network where an arbitrary number of process may become Byzantine.