Results 1 
6 of
6
A Survey of SelfStabilizing SpanningTree Construction Algorithms
, 2003
"... Selfstabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore wellsuited for dynamic, failure prone environments. Spanningtree construction in distributed systems is a fundamental task which forms the basis for many other network algorithm ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Selfstabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore wellsuited for dynamic, failure prone environments. Spanningtree construction in distributed systems is a fundamental task which forms the basis for many other network algorithms (like token circulation or routing). This paper surveys selfstabilizing algorithms that construct a spanning tree within a network of processing entities. Lower bounds and related work are also discussed.
A distributed algorithm for constructing a minimum diameter spanning tree
 J. Parallel Distrib. Comput
, 2004
"... We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (nonnegatively) realweighted graph G = (V,E,ω). As an intermediate step, we use a new, fast, lineartime allpairs shortest paths distributed algorithm to find an absolute center ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (nonnegatively) realweighted graph G = (V,E,ω). As an intermediate step, we use a new, fast, lineartime allpairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(V ) time complexity and O(V E) message complexity.
Computing A DiameterConstrained Minimum Spanning Tree
, 2001
"... In numerous practical applications, it is necessary to find the smallest possible tree with a bounded diameter. A diameterconstrained minimum spanning tree (DCMST) of a given undirected, edgeweighted graph, G, is the smallestweight spanning tree of all spanning trees of G which contain no path wi ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
In numerous practical applications, it is necessary to find the smallest possible tree with a bounded diameter. A diameterconstrained minimum spanning tree (DCMST) of a given undirected, edgeweighted graph, G, is the smallestweight spanning tree of all spanning trees of G which contain no path with more than k edges, where k is a given positive integer. The problem of finding a DCMST is NPcomplete for all values of k; 4 k (n  2), except when all edgeweights are identical. A DCMST is essential for the efficiency of various distributed mutual exclusion algorithms, where it can minimize the number of messages communicated among processors per critical section. It is also useful in linear lightwave networks, where it can minimize interference in the network by limiting the traffic in the network lines. Another practical application requiring a DCMST arises in data compression, where some algorithms compress a file utilizing a tree datastructure, and decompress a path in the tree to access a record. A DCMST helps such algorithms to be fast without sacrificing a lot of storage space. We present a survey of the literature on the DCMST problem, study the expected diameter of a random labeled tree, and present five new polynomialtime algorithms for an approximate DCMST. One of our new algorithms constructs an approximate DCMST in a modified greedy fashion, employing a heuristic for selecting an edge to be added to iii the tree in each stage of the construction. Three other new algorithms start with an unconstrained minimum spanning tree, and iteratively refine it into an approximate DCMST. We also present an algorithm designed for the special case when the diameter is required to be no more than 4. Such a diameter4 tree is also used for evaluating the quality of o...
SelfStabilization In Distributed Systems  A Short Survey
 FOUNDATIONS OF COMPUTING AND DECISION SCIENCES
, 2000
"... Selfstabilization is a very interesting and promising research field in computing science. This is due to its guarantees of automatic recovery from any transient failure, without any additional effort. This paper presents an overview of selfstabilizing distributed algorithms. First, the outlook of ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Selfstabilization is a very interesting and promising research field in computing science. This is due to its guarantees of automatic recovery from any transient failure, without any additional effort. This paper presents an overview of selfstabilizing distributed algorithms. First, the outlook of the selfstabilization paradigm is shown, followed by a simple example and some formal definitions. Then, characteristics of stabilization types are described. Finally, the paper presents several selfstabilizing algorithms and further lines of investigation strive for distributed systems. 1. Introduction One of the most wanted properties of distributed systems is fault tolerance. This can be achieved, in general, by two different approaches: pessimistic and optimistic. In the former, we deal with robust algorithms protected against any possible (i.e. the most pessimistic) or admissible set of failures. In the latter case, we use selfstabilizing algorithms, which after any failure guara...
MemoryEfficient SelfStabilizing Algorithm to Construct BFS Spanning Trees
"... In this paper, we consider the problem of faulttolerant distributed BFS spanning tree construction. We present an algorithm which requires only O(1) bits of memory per incident network edge on an uniform rooted network (no identifier, but a distinguished root). The algorithm works even in the cas ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we consider the problem of faulttolerant distributed BFS spanning tree construction. We present an algorithm which requires only O(1) bits of memory per incident network edge on an uniform rooted network (no identifier, but a distinguished root). The algorithm works even in the case of worst transient faults (i.e., it is selfstabilizing).
Prod:Type:FTP pp:127ðcol:fig::NILÞ ED:Nagesh PAGN: vs SCAN: Shivak ARTICLE IN PRESS 1 3 5
, 2000
"... J. Parallel Distrib. Comput.] (]]]])]]]–]]] A distributed algorithm for constructing a minimum diameter spanning tree ..."
Abstract
 Add to MetaCart
J. Parallel Distrib. Comput.] (]]]])]]]–]]] A distributed algorithm for constructing a minimum diameter spanning tree