Distance-k Information in Self-stabilizing Algorithms [chapter]

Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Vilmar Trevisan
2006 Lecture Notes in Computer Science  
In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors' states), yet in a finite amount of time the system converges to a global state satisfying some desired property. In this paper we introduce a general mechanism that allows a node to act only on correct distance-two knowledge, provided there are IDs. We then apply the mechanism to graph problems in the areas of coloring and domination. For
more » ... e, we obtain an algorithm for maximal 2-packing which is guaranteed to stabilize in polynomial moves under a central daemon.
doi:10.1007/11780823_27 fatcat:thsf3xctznfudat7hx7p6pkmly