Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Graphs, ALgorithms and Combinatorics
Self-Stabilization and Byzantine Tolerance for Maximal Matching
Laurence Pilard

22 February 2019, 14:30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Networking

Résumé :
We analyse the impact of transient and Byzantine faults on the construction of a maximal matching in a general network. In particular, we consider the self-stabilizing algorithm called AnonyMatch presented by Cohen et al. in PPL'2016 for computing such a matching. Since self-stabilization is transient fault tolerant, we prove that this algorithm still works under the more difficult context of arbitrary Byzantine faults. Byzantine nodes can prevent nodes close to them from taking part in the matching for an arbitrarily long time. We give some bound on their impact depending on the distance between a non-Byzantine node and the closest Byzantine, called the containment radius. We present the first algorithm tolerating both transient and Byzantine faults under the fair distributed daemon while keeping the best known containment radius.

Pour en savoir plus :
Séminaires
Forum dev-LRI
Tuesday 26 November 2019 - 14:00
Salle : 445 - PCRI-N
Jonas et Erik .............................................

Langage d'icônes et visualisation d'ensembles : mé
Thursday 14 November 2019 - 14:30
Salle : 475 - PCRI-N
Jean-Baptiste Lamy .............................................

Algorithms for Cell Reprogramming Strategies in Bo
Thursday 07 November 2019 - 00:00
Salle : 475 - PCRI-N
Hugues Mandon .............................................

On the weakest failure detector for atomic multica
Distributed algorithms
Tuesday 05 November 2019 - 10:30
Salle : 465 - PCRI-N
Pierre Sutra .............................................

Matchings and related structures with Specified Co
Graph Theory
Thursday 17 October 2019 - 14:30
Salle : 445 - PCRI-N
Yannis Manoussakis .............................................