A self-stabilizing ranking algorithm for tree structured networks
B. Bourgon, A.K. Datta, Vijay Natarajan · 1995
This paper presents a self-stabilizing algorithm for ranking a group of processors connected in a distributed system. The protocol suggested is resilient to transient failures, and is guaranteed to recover in finite time. This resiliency is achieved through self-stabilization which guarantees convergence to the desired behavior within finite time. This protocol has application in leader election, routing, agreement, and all other applications requiring unique identification of nodes.>