pith. sign in

arxiv: 1204.4565 · v1 · pith:S3A7YAGGnew · submitted 2012-04-20 · 💻 cs.DC

Mariages et Trahisons

classification 💻 cs.DC
keywords faultsself-stabilizingbyzantineablearbitraryfocusnumberprotocols
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.