A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loop-free property provides interesting safety assurance in dynamic networks where edge-cost changes during operation of the protocol. We present a new self-stabilizing MST protocol that improves on previous known ap- proaches in several ways. First, it makes fewer system hypotheses as the size of the network (or an upper bound on the size) need not be known to the participants. Second, it is loop-free in the sense that it guarantees that a spanning tree structure is always preserved while edge costs change dynamically and the protocol adjusts to a new MST. Finally, time complexity matches the best known results, while space complexity results show that this protocol is the most efficient to date.

💡 Research Summary

The paper introduces a novel distributed protocol that simultaneously achieves self‑stabilization and loop‑freedom for the Minimum Spanning Tree (MST) problem in dynamic networks. Unlike earlier self‑stabilizing MST algorithms, the proposed solution does not require any knowledge of the network size, an upper bound on the number of nodes, or unique node identifiers. Each node stores only O(log n) bits of state, making the memory footprint the smallest among all known self‑stabilizing MST constructions.

The algorithm is built around the classic “red rule”: in any cycle, the heaviest edge can be safely removed without destroying the optimality of the MST. To apply this rule in a fully distributed, asynchronous setting, the authors maintain a spanning tree together with a pre‑order labeling of its nodes. A token circulates continuously along the tree, propagating the labels and enabling every node to discover the unique path between any two nodes in the current tree. When a non‑tree edge e is examined, it creates a fundamental cycle Ce when added to the tree. The node that first receives the token on e initiates a traversal of Ce to locate the edge f with maximum weight. If w(e) < w(f), the algorithm atomically swaps e for f, thereby improving the tree. Because the token enforces a strict order of cycle examinations, simultaneous conflicting swaps cannot occur, guaranteeing that the tree structure never breaks and never forms a loop, even while edge weights are changing.

The protocol consists of three loosely coupled sub‑procedures:

1. Tree Construction – a self‑stabilizing, loop‑free spanning‑tree construction (based on prior work