Self-Stabilizing Algorithms for Tree Metrics
Keyword(s):
We present algorithms for finding the diameter, centroid(s), and median(s) for tree structured networks subject to transient faults. In our solutions, the system reaches its final correct configuration in a finite time after the faults cease. The fault-tolerance is achieved using Dijkstra's paradigm of self-stabilization. A self-stabilizing algorithm, regardless of the initial system configuration, converges, in finite time, to a set of legitimate configurations.
Keyword(s):
1997 ◽
Vol 28
(11)
◽
pp. 1177-1187
◽
Keyword(s):
2019 ◽
Vol 7
(1)
◽
pp. 01-04
Keyword(s):
2021 ◽
2011 ◽
Vol 2011
◽
pp. 1-15
◽
Keyword(s):
2020 ◽
Vol 16
(2)
◽
pp. 1172-1181
◽