Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1

Details Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1 Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1

2011-04-20

arxiv.org/abs/1104.4022v1

Computer Science

Distributed, Parallel, and Cluster Computing

13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel) (2011)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432891