Self-Stabilizing Distributed Cooperative Reset

This paper provides a self-stabilizing distributed protocol able to recover a correct trie starting from an arbitrary labelled graph topology, with nodes in an arbitrary state,

Note that several works in the area of self-stabilization may be used as daemon transformers although they were not initially designed with this goal in mind (e.g. a

The goal of the paper is to provide designers of distributed self- stabilizing protocols with a fair and reliable communication primitive which allows any process which writes a

In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the

A simple and silent self-stabilizing protocols building k-independent dominating sets is presented. The protocol converges under the unfair distributed scheduler (the weakest

The stabilization time of a silent self-stabilizing algorithm is the maximum time (in steps or rounds) over every execution (starting from any initial configuration) to reach a

2.4 Self-stabilizing algorithms for some graph problems Given the importance of graph theory for studying different problems that arise in many areas (communication networks,

Self-stabilization in Sensor Networks Transform (i.e. Simulate) the self-stabilizing model into the sensor networks model. � Pros: reuse existing