This paper presents self-stabilizing algorithms for finding the diameter, centroid(s) and media+) of a tree. The algorithms compute these metria of a tree.

We present algorithms for finding the diameter, centroid(s), and median(s) for tree structured networks subject to transient faults.

This research work presents self-stabilizing algorithms for calculating metrics such as diameter, centroid and median and for achieving mutual exclusion on a ...

Missing: Metrics. | Show results with:Metrics.

Abstract. Designers of distributed algorithms have to contend with the problem of making the algorithms tolerant to several forms of coordination loss, ...

Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, in luding some rooting algorithms for ...

In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our ...

This paper presents simple self-stabilizing algorithms for locating centers and medians of trees. Since these algorithms are self-stabilizing, they can tolerate ...

In this paper, we present a self-stabilizing algorithm that computes the breadth first spanning tree in arbitrary graph, with 0(n3) time complexity using ...

We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by ...