An exercise in proving self-stabilization with a variant function
Information Processing Letters
A self-stabilizing algorithm for maximal matching
Information Processing Letters
Maximal matching stabilizes in quadratic time
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Maximal matching stabilizes in time O(m)
Information Processing Letters
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Self-stabilizing algorithms for {k}-domination
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A memory efficient self-stabilizing algorithm for maximal k-packing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Information Processing Letters
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2-packing if all nodes in S lie at distance three or more from each other, counting the number of edges. In this paper we present an ID-based, self-stabilizing algorithm for finding a maximal 2-packing, a non-local property, in an arbitrary graph. We also show how to use Markov analysis to analyse the behaviour of a non-ID-based version of the algorithm.