On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics

Abstract

We consider self-stabilization and its weakened form called pseudo-stabilization. We study conditions under which (pseudo- and self-) stabilizing leader election is solvable in networks subject to frequent topological changes. To model such an high dynamics, we use the dynamic graph (DG) paradigm and study a taxonomy of nine important DG classes. Our results show that self-stabilizing leader election can only be achieved in the classes where all processes are sources. Furthermore, even pseudo-stabilizing leader election cannot be solved in all remaining classes, except in the class where at least one process is a timely source. We illustrate that result by proposing a pseudo-stabilizing leader election algorithm for the latter class. We also show that in this last case, the convergence time of pseudo-stabilizing leader election algorithms cannot be bounded. Nevertheless, we show that our solution is speculative since its convergence time can be bounded when the dynamics is not too erratic, precisely when all processes are timely sources.

Dates and versions

hal-03346225 , version 1 (16-09-2021)

Identifiers

Cite

Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit. On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC '21: ACM Symposium on Principles of Distributed Computing, Jul 2021, Virtual Event, Italy. pp.21-31, ⟨10.1145/3465084.3467917⟩. ⟨hal-03346225⟩
73 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More