Time Optimal Self-Stabilizing Algorithms

13 years 9 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree construction, the connectivity or orientation on certain interconnection networks. These bounds are of the form (D), where D is the diameter of the network. Moreover, time-optimal self-stabilizing algorithms for computing the orientation on tori, rings, hypercubes, CCC, butter ies, stars and outerplanar graphs are presented. This gives an a rmative answer to the problem 15:4 for tori stated in Tel 94b]. Key Words: stabilization time, self-stabilizing algorithm, fault-tolerance, network orientation, interconnection network, outerplanar graph, distributed system Category: C.2.4
Rastislav Kralovic
Added 08 Aug 2010
Updated 08 Aug 2010
Type Conference
Year 1997
Authors Rastislav Kralovic
Comments (0)