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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Blin, L., Potop-Butucaru, M. G., Rovedakis, S., & Tixeuil, S. (2010). Loop-free super-stabilizing spanning tree construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6366 LNCS, pp. 50–64). https://doi.org/10.1007/978-3-642-16023-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
