Self-stabilizing algorithms for tree metrics

This paper presents self-stabilizing algorithms for finding the diameter, centroid(s) and median(s) of a tree. The algorithms compute these metrics of a tree in a finite number of steps. The distributed tree structured system is maintained by another self-stabilizing spanning tree protocol over a graph. This makes the system resilient to transient failures, from which it is guaranteed to recover after a finite number of moves.<
>