Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Self-stabilizing depth-first search
Information Processing Letters
Randomized algorithms
Memory efficient, self-stabilizing algorithm to construct BFS spanning trees
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Parallel Algorithms for Dandelion-Like Codes
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Unified parallel encoding and decoding algorithms for Dandelion-like codes
Journal of Parallel and Distributed Computing
Parallel algorithms for encoding and decoding blob code
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages of size O(log n) on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches.