Paper Info
Title
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics
Abstract
We initiate research on self-stabilization in highly dynamic identified message-passing systems where dynamics is modeled using time-varying graphs (TVGs). More precisely, we address the self-stabilizing leader election problem in three wide classes of TVGs: the class TCB (Δ) of TVGs with temporal diameter bounded by Δ, the class TCB (Δ) of TVGs with temporal diameter quasi-bounded by Δ, and the class TCR of TVGs with recurrent connectivity only, where TCB (Δ) ⊆ TCB (Δ) ⊆ TCR. We first study conditions under which our problem can be solved. Precisely, we introduce the notion of size-ambiguity to show that the assumption on the knowledge of the number n of processes is central. Our results reveal that, despite the existence of unique process identifiers, any deterministic self-stabilizing leader election algorithm working in the TVG class TCB (Δ) or TCR cannot be size-ambiguous, justifying why our solutions for those classes assume the exact knowledge of n. We then present three self-stabilizing leader election algorithms for the TVG classes TCB (Δ), TCB(Δ), and TCR, respectively.
Year
DOI
Venue
2020
10.1145/3382734.3404502
PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020
DocType
ISBN
Citations 
Conference
978-1-4503-7582-5
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
K. Altisen115013.16
Stéphane Devismes219225.74
Anaïs Durand3104.29
Colette Johnen436431.21
Franck Petit573660.02