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 logn) 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 logn) 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. © 2011 Springer-Verlag.
CITATION STYLE
Datta, A. K., Devismes, S., Larmore, L. L., & Rivierre, Y. (2011). Self-stabilizing labeling and ranking in ordered trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6976 LNCS, pp. 148–162). https://doi.org/10.1007/978-3-642-24550-3_13
Mendeley helps you to discover research relevant for your work.