# Self-Stabilizing Distributed Cooperative Reset

## TL;DR

This paper introduces a self-stabilizing reset algorithm for anonymous networks that enables fault recovery and is adaptable to various problems, improving efficiency and generality over previous solutions.

## Contribution

It presents a novel distributed reset algorithm that is multi-initiator and cooperative, applicable to multiple problems, and enhances existing algorithms in efficiency and generality.

## Key findings

- Applicable to static and dynamic network specifications
- Improves complexity for unison problem in anonymous networks
- Extends to self-stabilizing solutions for f,g)-alliance problem

## Abstract

Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset algorithm working in anonymous networks. This algorithm resets the network in a distributed non-centralized manner, i.e., it is multi-initiator, as each process detecting an inconsistency may initiate a reset. It is also cooperative in the sense that it coordinates concurrent reset executions in order to gain efficiency. Our approach is general since our reset algorithm allows to build self-stabilizing solutions for various problems and settings. As a matter of facts, we show that it applies to both static and dynamic specifications since we propose efficient self-stabilizing reset-based algorithms for the (1-minimal) $f,g)-alliance (a generalization of the dominating set problem) in identified networks and the unison problem in anonymous networks. Notice that these two latter instantiations enhance the state of the art. Indeed, in the former case, our solution is more general than the previous ones; while in the latter case, the complexity of the proposed unison algorithm is better than that of previous solutions of the literature.