Academic Journal
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics
| Τίτλος: | On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics |
|---|---|
| Συγγραφείς: | Altisen, Karine, Devismes, Stéphane, Durand, Anaïs, Johnen, Colette, Petit, Franck |
| Συνεισφορές: | Altisen, Karine, VERIMAG (VERIMAG - IMAG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), Université Grenoble Alpes, VERIMAG, UMR 5104, France, LIMOS, Université Clermont Auvergne, CNRS, UMR 6158, France, Université de Bordeaux, LaBRI, UMR 5800, France, Sorbonne Université, Paris, LIP6, UMR 7606, France, ANR-16-CE25-0009,ESTATE,Auto-stabilisation et amélioration de la sûreté dans les environnements distribués évoluant dans le temps(2016), ANR-16-CE40-0023,DESCARTES,Abstraction modulaire pour le calcul distribué(2016) |
| Πηγή: | Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :21-31 |
| Στοιχεία εκδότη: | ACM, 2021. |
| Έτος έκδοσης: | 2021 |
| Θεματικοί όροι: | pseudo-stabilization, sources, [INFO.INFO-DC]Computer Science [cs]/Distributed, sinks, speculation, leader election, dynamic graphs, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0102 computer and information sciences, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, self-stabilization, and Cluster Computing [cs.DC], timely sinks, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], timely sources, [INFO]Computer Science [cs] |
| Περιγραφή: | 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 this 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. MSC Classification: 68W15 68M15 |
| Τύπος εγγράφου: | Article Conference object Report |
| Περιγραφή αρχείου: | application/pdf |
| DOI: | 10.1145/3465084.3467917 |
| DOI: | 10.21203/rs.3.rs-3281830/v1 |
| Σύνδεσμος πρόσβασης: | https://hal.archives-ouvertes.fr/hal-02979166/file/evolvingSourceElection.pdf https://hal.science/hal-03346225v1/document https://doi.org/10.1145/3465084.3467917 https://hal.science/hal-03346225v1 https://hal.archives-ouvertes.fr/hal-02979166/document https://dblp.uni-trier.de/db/conf/podc/podc2021.html#AltisenDDJP21 https://hal.archives-ouvertes.fr/hal-02979166 https://dl.acm.org/doi/pdf/10.1145/3465084.3467917 https://www.podc.org/podc2021/list-of-accepted-papers/#17 |
| Rights: | CC BY URL: https://www.acm.org/publications/policies/copyright_policy#Background |
| Αριθμός Καταχώρησης: | edsair.doi.dedup.....1b51c095ced729c49e6a5e16ec8eba5a |
| Βάση Δεδομένων: | OpenAIRE |
| DOI: | 10.1145/3465084.3467917 |
|---|