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

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

Activités de recherche : Réseaux

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
Knowledge Graph Refinement based on Triplet BERT-N
Gestion de données du Web
Monday 29 November 2021 - 13h00
Salle : 455 - PCRI-N
Armita Khajeh Nassiri .............................................

A Hyper-graph Approach for Computing EL+-Ontology
Raisonnement automatique
Monday 15 November 2021 - 13h00
Salle : 445 - PCRI-N
Hui Yang .............................................

Semantic approaches to predict the presence of asb
Intégration de données et de connaissances
Monday 08 November 2021 - 13h00
Salle : 455 - PCRI-N
Thamer Mecharnia .............................................

Pierre Andrieu - Agrégation de classements pour le
Thursday 21 October 2021 - 00h00
Salle : 435 - PCRI-N
.............................................

A counting argument for graph colouring
Théorie des graphes
Friday 08 October 2021 - 11h00
Salle : 445 - PCRI-N
Francois Pirot .............................................