Mariages et Trahisons

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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00689348
Contributor : Swan Dubois <>
Submitted on : Friday, April 20, 2012 - 9:47:33 AM
Last modification on : Tuesday, May 14, 2019 - 11:01:12 AM
Long-term archiving on : Saturday, July 21, 2012 - 2:20:52 AM

Files

Algotel12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00689348, version 1
  • ARXIV : 1204.4565

Citation

Swan Dubois, Sébastien Tixeuil, Nini Zhu. Mariages et Trahisons. AlgoTel'12 - 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2012, La Grande Motte, France. pp.1-4. ⟨hal-00689348⟩

Share

Metrics

Record views

338

Files downloads

146