Results 1  10
of
417
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
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
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
SelfStabilizing Unidirectional Network Algorithms by PowerSupply
 Chicago Journal of Theoretical Computer Science
, 1997
"... Powersupply, a surprisingly simple and new general paradigm for the development of selfstabilizing algorithms in different models, is introduced. The paradigm is exemplified by developing simple and efficient selfstabilizing algorithms for leader election and either BFS or DFS spanning tree co ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
Powersupply, a surprisingly simple and new general paradigm for the development of selfstabilizing algorithms in different models, is introduced. The paradigm is exemplified by developing simple and efficient selfstabilizing algorithms for leader election and either BFS or DFS spanning tree
Selfstabilizing minimumdegree spanning tree within one from the optimal degree
 in "IPDPS
"... We propose a selfstabilizing algorithm for constructing a MinimumDegree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most ∆ ∗ + 1, where ∆ ∗ ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We propose a selfstabilizing algorithm for constructing a MinimumDegree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most ∆ ∗ + 1, where
SelfStabilizing Tree and Cluster Management for Dynamic Networks
"... Abstract: The lack of infrastructure and dynamic nature of mobile ad hoc networks demand new networking strategies to be implemented in order to provide efficient endtoend communication. Some researches proposed to organize the network into groups called clusters and use different routing protocol ..."
Abstract
 Add to MetaCart
solutions need to know the global network topology. In this paper, we propose a selfstabilizing algorithm both to construct cluster and simultaneously build a spanning tree on the network. Without any global knowledge, we use only one type of periodically exchanged messages of size Log(5n + 3) bits
Competitive selfstabilizing kclustering
 IN IEEE 32TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING (ICDCS’12
, 2012
"... A kcluster of a graph is a connected nonempty subgraph C of radius at most k, i.e., all members of C are within distance k of a particular node of C, called the clusterhead of C. A kclustering of a graph is a partitioning of the graph into distinct kclusters. Finding a minimum cardinality kclu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
clustering of the same network. More generally, if the network is an Approximate Disk Graph (ADG) with approximation ratio λ, then our algorithm is 7.2552λ2k +O(λ)competitive. Our solution is based on the selfstabilizing construction of a data structure called the MIS Tree, a spanning tree of the network whose
A SelfStabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph
 Computers and Mathematics with Applications
, 1992
"... We propose a simple and efficient selfstabilizing distributed algorithm to construct the breadth first search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The appr ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
We propose a simple and efficient selfstabilizing distributed algorithm to construct the breadth first search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm
The Local Detection Paradigm and its Applications to SelfStabilization
"... A new paradigm for the design of selfstabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in defining a local condition based on the state of a processor and its immediate neighborhood, such that the system is in a globally legal state if and onl ..."
Abstract

Cited by 29 (10 self)
 Add to MetaCart
and randomized selfstabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically. The deterministic algorithm assumes unique identities while the randomized assumes an anonymous network. The algorithms use a constant number of memory words per edge in each
Results 1  10
of
417