Making Self-Stabilizing Algorithms for Any Locally Greedy Problem - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Proceedings Year : 2023

Making Self-Stabilizing Algorithms for Any Locally Greedy Problem

Abstract

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.

Dates and versions

hal-04214291 , version 1 (21-09-2023)

Identifiers

Cite

Johanne Cohen, Laurence Pilard, Jonas Sénizergues, Mikaël Rabie. Making Self-Stabilizing Algorithms for Any Locally Greedy Problem. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, ⟨10.4230/LIPIcs.SAND.2023.11⟩. ⟨hal-04214291⟩
22 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More