Self-stabilizing network orientation algorithms in arbitrary rooted networks
Asoke Kumar Datta, Sankar Gurumurthy, Franck Petit, Vincent Villain · 2002
We present the first deterministic self-stabilizing network orientation algorithms. We present three protocols for arbitrary and asynchronous networks. All the protocols set up a chordal sense of direction in the network. The protocols are self-stabilizing, meaning that starting from an arbitrary state, the protocols are guaranteed to reach a state, in which all edge labels (assigned to the links) are valid (meaning, they satisfy the specification of the orientation problem).