11:00
12:00

Jonas Sénizergues

Title: Self-stabilizing Minimal Clique Decomposition with Byzantine Fault tolerance

Abstract:

In distributed systems, a clique decomposition of the communication graph (i.e. a partition of the vertices such that every part of the partition induce a clique in the graph) can provide a natural way to structure the communication graph into fully connected groups. In this work, we aim to provide a way to compute a minimal clique decomposition in asynchronous networks in spite of both transient and byzantine faults happening in the network while keeping memory usage low. We rely on self-stabilization to handle transcient faults, and use containment to guarantee that the provided solution is good as long as we are far enough from the malicious byzantine nodes.

https://algodist.labri.fr/index.php/Main/GT

Français
LaBRI 178