Foundations of computer science
Foundations of computer science
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
IEEE Transactions on Computers
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Snap-Stabilizing PIF Algorithm in Arbitrary Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Snap-Stabilizing PIF and Useless Computations
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
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
Snap-Stabilizing detection of cutsets
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The first fully polynomial stabilizing algorithm for BFS tree construction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Stabilizing algorithms can automatically recover their specifications from an arbitrary configuration in finite time. They are therefore well-suited for dynamic and failure prone environments. A silent algorithm always reaches a terminal configuration in a finite time. The spanning-tree construction is a fundamental task in distributed systems which forms the basis for many other network algorithms (like Token Circulation, Routing or Propagation of Information with Feedback). In this paper we present a silent stabilizing algorithm working in n2 steps (where n is the number of processors in the network) with a distributed daemon, without any fairness assumptions. This complexity is totally independent of the initial values present in the network. So, this improves all the previous results of the literature.