Title :
Self-stabilizing algorithms for tree metrics
Author :
Datta, AjoyKumar ; Gonzalez, Teofilo F. ; Thiagarajan, Visalakshi
Author_Institution :
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
Abstract :
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
Keywords :
computer network reliability; fault tolerant computing; protocols; centroid; distributed tree structured system; median; self-stabilizing algorithms; self-stabilizing spanning tree protocol; transient failures; tree metrics; Computer networks; Computer science; Distributed algorithms; Network topology; Routing protocols; Tree graphs;
Conference_Titel :
Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on
Conference_Location :
Brisbane, Qld.
Print_ISBN :
0-7803-2018-2
DOI :
10.1109/ICAPP.1995.472220
