Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing depth-first search
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Distributed Reset (Extended Abstract)
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Snap-Stabilizing PIF and Useless Computations
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Snap-Stabilizing Depth-First Search on Arbitrary Networks
The Computer Journal
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-Stabilizing Leader Election in Optimal Space
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A snap-stabilizing DFS with a lower space requirement
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
The construction of a spanning tree is a fundamental task in distributed systems which allows to resolve other tasks (i.e., routing, mutual exclusion, network reset). In this paper, we are interested in the problem of constructing a Breadth First Search (BFS) tree. Stabilization is a versatile technique which ensures that the system recover a correct behavior from an arbitrary global state resulting from transient faults. A fully polynomial algorithm has a round complexity in O(da) and a step complexity in O(nb) where d and n are the diameter and the number of nodes of the network and a and b are constants. We present the first fully polynomial stabilizing algorithm constructing a BFS tree under a distributed daemon. Moreover, as far as we know, it is also the first fully polynomial stabilizing algorithm for spanning tree construction. Its round complexity is in O(d2) and its step complexity is in O(n6). To our knowledge, since in general the diameter of a network is much smaller than the number of nodes (log(n) in average instead of n), this algorithm reaches the best compromise of the literature between the complexities in terms of rounds and in terms of steps.