A data structure for dynamic trees
Journal of Computer and System Sciences
IEEE Transactions on Software Engineering
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Self-stabilization
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Self-stabilizing multicast protocols for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Optimal snap-stabilizing depth-first token circulation in tree networks
Journal of Parallel and Distributed Computing
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.00 |
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loopfree property provides interesting safety assurance in dynamic networks where edge-cost changes during operation of the protocol. We present a new self-stabilizing MST protocol that improves on previous known approaches in several ways. First, it makes fewer system hypotheses as the size of the network (or an upper bound on the size) need not be known to the participants. Second, it is loop-free in the sense that it guarantees that a spanning tree structure is always preserved while edge costs change dynamically and the protocol adjusts to a new MST. Finally, time complexity matches the best known results, while space complexity results show that this protocol is the most efficient to date.