Skip to main content
Article thumbnail
Location of Repository

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

By Swan Dubois, Toshimitsu Masuzawa and Sébastien Tixeuil

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.Comment: 13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel) (2011

Topics: Computer Science - Distributed, Parallel, and Cluster Computing
Year: 2011
OAI identifier: oai:arXiv.org:1104.4022
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.4022 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.