A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, causes the system to recover in finite time without external (e.g., human) intervention. In this paper, we give a distributed asynchronous silent self-stabilizing algorithm for finding a minimal k-dominating set of at most n k+1 processes in an arbitrary identified network of size n. We give a transformer that allows our algorithm to work under an unfair daemon, the weakestdoi:10.1109/icnc.2011.15 dblp:conf/ic-nc/DevismesHRDL11 fatcat:smbuulljebaehcdrmw3fkilo2u