 |
Free and accessible knowledge |
Journal articles
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction
Abstract : The construction of a spanning tree is a fundamental task in distributed systems which allows to resolve other tasks (i.e., routing, mutual exclusion, network reset). In this paper, we are interested in the problem of constructing a Breadth First Search (BFS) tree. Stabilization is a versatile technique which ensures that the system recovers a correct behavior from an arbitrary global state resulting from transient faults.A fully polynomial algorithm has a round complexity in $O(d^a)$ and a step complexity in $O(n^b)$ where $d$ and $n$ are the diameter and the number of nodes of the network and $a$ and $b$ are constants. We present the first fully polynomial stabilizing algorithm constructing a BFS tree under a distributed daemon. Moreover, as far as we know, it is also the first fully polynomial stabilizing algorithm for spanning tree construction. Its round complexity is in $\Theta(d^2)$ and its step complexity is in $O(n^6)$.
https://hal.archives-ouvertes.fr/hal-02470990
Contributor : Accord Elsevier Ccsd Connect in order to contact the contributor
Submitted on : Friday, October 22, 2021 - 7:21:38 AM
Last modification on : Monday, February 21, 2022 - 3:38:19 PM
Long-term archiving on: : Sunday, January 23, 2022 - 6:14:02 PM
Contributor : Accord Elsevier Ccsd Connect in order to contact the contributor
Submitted on : Friday, October 22, 2021 - 7:21:38 AM
Last modification on : Monday, February 21, 2022 - 3:38:19 PM
Long-term archiving on: : Sunday, January 23, 2022 - 6:14:02 PM
File
S0890540119300069.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License