Time Optimal Synchronous Self Stabilizing Spanning Tree

@inproceedings{Kravchik2013TimeOS,
  title={Time Optimal Synchronous Self Stabilizing Spanning Tree},
  author={A. Kravchik and S. Kutten},
  booktitle={DISC},
  year={2013}
}
This paper presents an improved and time-optimal selfstabilizing algorithm for a major task in distributed computing- a rooted spanning tree construction. Our solution is decentralized ("truly distributed"), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known. The algorithm assumes asynchronous and reliable FIFO message passing and unique identifiers, and… Expand
Self-stabilizing Leader Election in Polynomial Steps
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks
...
1
2
3
4
...

References

SHOWING 1-10 OF 57 REFERENCES
Self-Stabilization with r-Operators revisited
Synchronous vs. Asynchronous Unison
Self-stabilizing multicast protocols for ad hoc networks
Optimal maintenance of a spanning tree
Time optimal self-stabilizing synchronization
When graph theory helps self-stabilization
...
1
2
3
4
5
...