Gaertner, Felix C.2005-07-132005-07-132005-07-132003https://infoscience.epfl.ch/handle/20.500.14299/214608Self-stabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore well-suited for dynamic, failure prone environments. Spanning-tree construction in distributed systems is a fundamental task which forms the basis for many other network algorithms (like token circulation or routing).This paper surveys self-stabilizing algorithms that construct a spanning tree within a network of processing entities. Lower bounds and related work are also discussed.self-stabilizationspanning treenetwork protocolsfault-tolerancetext::report