Self-Stabilizing Labeling And Ranking In Ordered Trees
SSS'11: Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems(2011)
摘要
We propose two self-stabilizing algorithms for tree networks. The first one computes a special label, called guide pair of each process Pin 0(h) rounds (h being the height of the tree) using O(delta(P) log n) space per process P, where delta(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 0(n) rounds and has space complexity O(b-delta(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.
更多查看译文
关键词
Self-stabilization,tree networks,tree labeling,ranking problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络