Self-stabilizing labeling and ranking in ordered trees

We give two self-stabilizing algorithms for tree networks. The first computes an index, called guide pair, for each process P in O(h) rounds using O(δPlogn) space per process, where h is the height of the tree, δP the degree of P, and n the number of processes in the network. Guide pairs have numerous applications, including ordered traversal or navigation in the tree. Our second algorithm, which uses the guide pairs computed by the first algorithm, solves in O(n) rounds the ranking problem for an ordered tree, where each process has an input value. This second algorithm has space complexity O(b+δPlogn) in each process P, where b is the number of bits needed to store an input value. The first algorithm orders the tree processes according to their topological positions. The second algorithm orders (ranks) the processes according to their input values.