Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
A Composite Stabilizing Data Structure
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Stabilizing Search Tree with Availability Properties
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
IEICE - Transactions on Information and Systems
Snap-Stabilizing optimal binary search tree
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
| Hi-index | 0.00 |
We propose two self-stabilizing algorithms for tree networks. The first one computes a special label, called guide pair of each process P in O(h) rounds (h being the height of the tree) using O(δP log n) space per process P, where δP is the degree of P and n the number of processes in the network. Guide pairs have numerous applications, including ordered traversal or navigation of the processes in the tree. Our second self-stabilizing algorithm, which uses the guide pairs computed by the first algorithm, solves the ranking problem in O(n) rounds and has space complexity O(b+δP log n) in each process P, where b is the number of bits needed to store a value. The first algorithm orders the tree processes according to their topological positions. The second algorithm orders (ranks) the processes according to the values stored in them.