pith. sign in

arxiv: 1104.4022 · v1 · pith:H72CFSUQnew · submitted 2011-04-20 · 💻 cs.DC

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

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

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.