We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing
algorithm with improved stabilization time complexity and fault-containment features. As a case study, a self-stabilizing
spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity.
Work was supported by Deutsche Forschungsgemeinschaft (DFG) as part of the Emmy Noether programme.