eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-06-12
11:1
11:17
10.4230/LIPIcs.SAND.2023.11
article
Making Self-Stabilizing Algorithms for Any Locally Greedy Problem
Cohen, Johanne
1
https://orcid.org/0000-0002-9548-5260
Pilard, Laurence
2
https://orcid.org/0000-0002-1104-8216
Rabie, Mikaël
3
Sénizergues, Jonas
1
Université Paris-Saclay, CNRS, LISN, 91405, Orsay, France
LI-PaRAD, UVSQ, Université Paris-Saclay, France
IRIF-CNRS, Université Paris Cité, France
Self-stabilizing algorithms are a way to deal with network dynamicity, as it will update itself after a network change (addition or removal of nodes or edges), as long as changes are not frequent. We propose an automatic transformation of synchronous distributed algorithms that solve locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks.
Mendable problems are a generalization of greedy problems where any partial solution may be transformed -instead of completed- into a global solution: every time we extend the partial solution, we are allowed to change the previous partial solution up to a given distance. Locally here means that to extend a solution for a node, we need to look at a constant distance from it.
In order to do this, we propose the first explicit self-stabilizing algorithm computing a (k,k-1)-ruling set (i.e. a "maximal independent set at distance k"). By combining this technique multiple times, we compute a distance-K coloring of the graph. With this coloring we can finally simulate Local model algorithms running in a constant number of rounds, using the colors as unique identifiers.
Our algorithms work under the Gouda daemon, similar to the probabilistic daemon: if an event should eventually happen, it will occur.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol257-sand2023/LIPIcs.SAND.2023.11/LIPIcs.SAND.2023.11.pdf
Greedy Problem
Ruling Set
Distance-K Coloring
Self-Stabilizing Algorithm