Efficient Self-stabilizing Algorithms for Tree Networks

@inproceedings{Blair2002EfficientSA,
  title={Efficient Self-stabilizing Algorithms for Tree Networks},
  author={Jean R. S. Blair and Fredrik Manne},
  year={2002}
}
Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(n3 + n2 · ch) moves, where n is the number of nodes in the network and ch is the highest initial value of a variable. In the current paper, we describe a new set of tree rooting algorithms that brings the complexity… CONTINUE READING