Universal Loop-Free Super-Stabilization

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universal Loop-Free Super-Stabilization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal Loop-Free Super-Stabilization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Loop-Free Super-Stabilization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-105209

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.