A New Self-stabilizing Algorithm for Maximal 2-packing

In the self-stabilizing algorithmic paradigm, each node has a local view of the system, in a finite amount of time the system converges to a global state with desired property. In a graph , a subset is a -packing if . In this paper, an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal -packing in an arbitrary graph is proposed. It is shown that the algorithm stabilizes in moves under any scheduler (daemon). Specifically, it is shown that the algorithm stabilizes in linear time-steps under a synchronous daemon where every privileged node moves at each time-step. Keywords—self-stabilization, -packing, distributed computing, fault tolerance, graph algorithms

[1]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[2]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[3]  Wayne Goddard,et al.  An anonymous self-stabilizing algorithm for 1-maximal independent set in trees , 2004, Inf. Process. Lett..

[4]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[5]  Wayne Goddard,et al.  Self-Stabilizing Algorithms For Orderings And Colorings , 2005, Int. J. Found. Comput. Sci..

[6]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[7]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[8]  Sandeep K. Shukla,et al.  Observations on self-stabilizing graph algorithms for anonymous networks , 1995 .

[9]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[10]  J. Moon,et al.  Relations between packing and covering numbers of a tree , 1975 .

[11]  Pradip K. Srimani,et al.  Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets , 2003 .

[12]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[13]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..

[14]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[15]  Aravind Srinivasan,et al.  The local nature of Δ-coloring and its algorithmic applications , 1995, Comb..