Results 1  10
of
621,140
A New SelfStabilizing Minimum Spanning Tree Construction with Loopfree Property, arXiv, May 2009, http://arxiv.org/abs/0905.2287
"... The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Selfstabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loopfre ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Selfstabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loopfree
Distributed SelfStabilizing Algorithm for Minimum Spanning Tree Construction
 IN EUROPEAN CONFERENCE ON PARALLEL PROCESSING
, 1997
"... Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a selfstabilizing distributed algorithm for the MST problem and to prove i ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a selfstabilizing distributed algorithm for the MST problem and to prove
A Uniform SelfStabilizing Minimum Diameter Spanning Tree Algorithm
"... We present a uniform selfstabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively realweighted graph. Our algorithm consists in two stages of stabilizing protocols. The first stage is a uniform randomized stabilizing uni ..."
Abstract
 Add to MetaCart
We present a uniform selfstabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively realweighted graph. Our algorithm consists in two stages of stabilizing protocols. The first stage is a uniform randomized stabilizing
A Uniform SelfStabilizing Minimum Diameter Spanning Tree Algorithm
"... We present a uniform selfstabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively realweighted graph. Our algorithm consists in two stages of stabilizing protocols. The first stage is a uniform randomized stabilizing uni ..."
Abstract
 Add to MetaCart
We present a uniform selfstabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively realweighted graph. Our algorithm consists in two stages of stabilizing protocols. The first stage is a uniform randomized stabilizing
Selfstabilizing spanning tree algorithm with a new design methodology
, 2004
"... Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a selfstabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a selfstabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages
Time Optimal Uniform SelfStabilizing Spanning Tree Algorithms
, 2001
"... In this paper an overview is given of selfstabilizing spanning tree algorithms as presented in the literature. In particular, three algorithms are discussed that have the important properties of being uniform as well as optimal in time of stabilization. The rst two algorithms construct a shortest ..."
Abstract
 Add to MetaCart
In this paper an overview is given of selfstabilizing spanning tree algorithms as presented in the literature. In particular, three algorithms are discussed that have the important properties of being uniform as well as optimal in time of stabilization. The rst two algorithms construct a shortest
Fast SelfStabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
, 2010
"... ar ..."
PolynomialTime SpaceOptimal Silent SelfStabilizing MinimumDegree Spanning Tree Construction
, 2014
"... Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimumdegree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a spaceoptimal silent selfstabilizing construction o ..."
Abstract
 Add to MetaCart
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimumdegree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a spaceoptimal silent selfstabilizing construction
Stabilization of LoopFree Redundant Routing
"... Abstract. Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore, there is a distinguished process, called root, that may be reached from any other process by following the s ..."
Abstract
 Add to MetaCart
, the following two nice properties are satisfied. First, if the initial state of the network forms a cDAG, then a cDAG is preserved at all times. Second, if the protocol is started from an arbitrary state (i.e., where each variable has an arbitrary value), then a cDAG is automatically restored. 1
Results 1  10
of
621,140