Repository landing page
Universal Loop-Free Super-Stabilization
Abstract
We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to a shortest path tree). Our scheme combines a novel super-stabilizing loop-free BFS with an existing self-stabilizing spanning tree that optimizes a given metric. The composition result preserves the best properties of both worlds: super-stabilization, loop-freedom, and optimization of the original metric without any stabilization time penalty. As case study we apply our composition mechanism to two well known metric-dependent spanning trees: the maximum-flow tree and the minimum degree spanning tree- info:eu-repo/semantics/preprint
- Preprints, Working Papers, ...
- [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
- [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
- [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]