A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves

Authors:
Adrian Kosowski;Łukasz Kuszner
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 6
Cited 5

A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed Reset

IEEE Transactions on Computers
Memory-Efficient Self Stabilizing Protocols for General Networks

WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Time Optimal Self-Stabilizing Spanning Tree Algorithms

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization

How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Snap-stabilizing linear message forwarding

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing algorithms for graph coloring with improved performance guarantees

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
A new polynomial silent stabilizing spanning-tree construction algorithm

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The first fully polynomial stabilizing algorithm for BFS tree construction

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the self-stabilizing model each node has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state. We discuss the construction of a solution to the spanning tree problem in this model. To our knowledge we give the first self-stabilizing algorithm working in a polynomial number of moves, without any fairness assumptions. Additionally we show that this approach can be applied under a distributed daemon. We briefly discuss implementation aspects of the proposed algorithm and its application in broadcast routing and in distributed computing.