Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract)
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Distributed Reset (Extended Abstract)
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal snap-stabilizing PIF algorithms in un-oriented trees
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
Stabilizing Peer-to-Peer Spatial Filters
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Journal of Parallel and Distributed Computing
Self-stabilizing minimum-degree spanning tree within one from the optimal degree
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
An improved snap-stabilizing PIF algorithm
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
We propose a self-stabilizing algorithm for constructing a Minimum Degree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most @D^*+1, where @D^* is the minimum possible maximum degree of a spanning tree of the network. To the best of our knowledge, our algorithm is the first self-stabilizing solution for the construction of a minimum degree spanning tree in undirected graphs. The algorithm uses only local communications (nodes interact only with the neighbors at one hop distance). Moreover, the algorithm is designed to work in any asynchronous message passing network with reliable FIFO channels. Additionally, we use a fine grained atomicity model (i.e., the send/receive atomicity). The time complexity of our solution is O(mn^2logn) where m is the number of edges and n is the number of nodes. The memory complexity is O(@dlogn) in the send-receive atomicity model (@d is the maximal degree of the network).