Time Optimal Asynchronous Self-Stabilizing Spanning Tree
نویسندگان
چکیده
This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computinga rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known. The algorithm assumes asynchronous and reliable FIFO message passing and unique identifiers, and works in dynamic networks and for any network topology. One of the previous time-optimal algorithms for this task was designed for a model with coarse-grained atomic operations and can be shown not to work properly for the totally asynchronous model (with just “read” or “receive” atomicity, and “write” or “send” atomicity). We revised the algorithm and proved it for a more realistic model of totally asynchronous
منابع مشابه
Time Optimal Synchronous Self Stabilizing Spanning Tree
This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computinga rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known...
متن کاملFast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a f...
متن کاملFast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a fa...
متن کاملSelf-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract)
Power-supply, a surprisingly simple and new general paradigm for the development of self-stabilizing algorithms in diierent models, is introduced. The paradigm is exempliied by developing simple and eecient self-stabilizing algorithms for leader election and either BFS or DFS spanning tree constructions, in strongly-connected unidirectional and bi-directional dynamic networks (synchronous and a...
متن کاملPolynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a space-optimal silent self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP...
متن کامل