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.<<ETX>>

[1]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[2]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[3]  Mehmet Hakan Karaata,et al.  Self-stabilizing algorithms for finding centers and medians of trees , 1994, PODC '94.

[4]  George Varghese.  Self-stabilization by counter flushing , 1994, PODC '94.

[5]  Anish Arora,et al.  Closure and convergence: a formulation of fault-tolerant computing , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[6]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[7]  Nicola Santoro,et al.  Distributed algorithms for finding centers and medians in networks , 1984, TOPL.

[8]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[9]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

[10]  Anish Arora,et al.  Closure and Convergence: A Foundation of Fault-Tolerant Computing , 1993, IEEE Trans. Software Eng..

[11]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[12]  H.L. Groginsky,et al.  A Pipeline Fast Fourier Transform , 1970, IEEE Transactions on Computers.

[13]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[14]  Mohamed G. Gouda,et al.  Token Systems that Self-Stabilize , 1989, IEEE Trans. Computers.