A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm

Stabilizing algorithms can automatically recover their specifications from an arbitrary configuration in finite time. They are therefore well-suited for dynamic and failure prone environments. A silent algorithm always reaches a terminal configuration in a finite time. The spanning-tree construction is a fundamental task in distributed systems which forms the basis for many other network algorithms (like Token Circulation, Routing or Propagation of Information with Feedback). In this paper we present a silent stabilizing algorithm working in n2 steps (where n is the number of processors in the network) with a distributed daemon, without any fairness assumptions. This complexity is totally independent of the initial values present in the network. So, this improves all the previous results of the literature.