Self-Stabilizing Distributed Cooperative Reset Article Swipe
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.1109/icdcs.2019.00045
· OA: W2910106363
Self-stabilization is a versatile fault-tolerance approach that characterizes\nthe ability of a system to eventually resume a correct behavior after any\nfinite number of transient faults. In this paper, we propose a self-stabilizing\nreset algorithm working in anonymous networks. This algorithm resets the\nnetwork in a distributed non-centralized manner, i.e., it is multi-initiator,\nas each process detecting an inconsistency may initiate a reset. It is also\ncooperative in the sense that it coordinates concurrent reset executions in\norder to gain efficiency. Our approach is general since our reset algorithm\nallows to build self-stabilizing solutions for various problems and settings.\nAs a matter of facts, we show that it applies to both static and dynamic\nspecifications since we propose efficient self-stabilizing reset-based\nalgorithms for the (1-minimal) $f,g)-alliance (a generalization of the\ndominating set problem) in identified networks and the unison problem in\nanonymous networks. Notice that these two latter instantiations enhance the\nstate of the art. Indeed, in the former case, our solution is more general than\nthe previous ones; while in the latter case, the complexity of the proposed\nunison algorithm is better than that of previous solutions of the literature.\n
