An implementable dynamic automatic self-stabilizing protocol

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 value in its own registers to make sure that every neighbour eventually does read that value. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The primitive runs a self-stabilizing protocol which implements a \rendezvous" communication mechanism in the link-register asynchronous model. This protocol works in arbitrary networks and also solves the problem of how to simulate reliable self-stabilizing message-passing in asynchronous distributed systems.

Lecture Notes in Computer Science, 2009

A self-stabilizing protocol can eventually recover its intended behavior even when started from an arbitrary configuration. Most of self-stabilizing protocols require every pair of neighboring processes to communicate with each other repeatedly and forever even after converging to legitimate configurations. Such permanent communication impairs efficiency, but is necessary in nature of self-stabilization: if we allow a process to stop its communication with other processes, the process may initially start and remain forever at a state inconsistent with the states of other processes. So it is challenging to minimize the number of process pairs communicating after convergence. We investigate possibility of communication-efficient self-stabilization, which allows only O(n) pairs of neighboring processes to communicate repeatedly after convergence. For spanningtree construction, we show the following results: (a) communication-efficiency is attainable when a unique root is designated a priori, (b) communication-efficiency is impossible to attain when each process has a unique identifier but without a designated unique root, and (c) communication-efficiency becomes attainable with process identifiers if each process initially knows an upper bound of the network size.

Distributed Computing, 2012

This paper presents a new transformation which adds fault-containment properties to any silent self-stabilizing protocol. The transformation features a constant slow-down factor and the fault-gap -that is the minimal time between two containable faults -is constant. The transformation scales well to arbitrarily large systems and avoids global synchronization.

Theoretical Computer Science, 2011

A wireless sensor network is a set of nodes, each is equipped with a sensing device and a wireless communication device. Because centralized control is hard to achieve in a large scale sensor network, self- * is a key concept in the design of a wireless sensor network. Self-stabilization is one of the self- * properties, and it is one of the most promising theoretical backgrounds for self-organizing wireless sensor network protocols. Herman [T. Herman, Models of self-stabilization and sensor networks, in: Proceedings of the 5th International Workshop of Distributed Computing, IWDC, 2003, pp. 205-214] proposed Cached Sensornet Transform (CST for short) for design and implementation of self-stabilizing algorithms for sensor networks. It transforms a self-stabilizing algorithm in a high-level computational model to a program for sensor networks. Our contribution in this paper is threefold. We show that there exists a non-silent algorithm that behaves correctly in a high-level computational model but its transformed version by CST does not behave correctly if packets are lost. We show a sufficient condition for original algorithms and networks such that the algorithm transformed by CST behaves correctly. As a case study, we present a token circulation algorithm that behaves correctly by CST and derive the upper bound of its expected convergence time.

Ieice Transactions on Information and Systems, 2009

A self-stabilizing protocol is a protocol that achieves its intended behavior regardless of the initial configuration (i.e., global state). Thus, a self-stabilizing protocol is adaptive to any number and any type of topology changes of networks: after the last topology change occurs, the protocol starts to converge to its intended behavior. This advantage makes self-stabilizing protocols extremely attractive for designing highly dependable distributed systems on dynamic networks. While conventional self-stabilizing protocols require that the networks remain static during convergence to the intended behaviors, some recent works undertook the challenge of realizing self-stabilization in dynamic networks with frequent topology changes. This paper introduces some of the challenges as a new direction of research in self-stabilization.

Lecture Notes in Computer Science, 2016

In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and the network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We also extend our approach to synthesize idealstabilizing protocols, where every state is legitimate. Our proposed methods are implemented and we report successful synthesis of Dijkstra's token ring and a self-stabilizing version of Raymond's mutual exclusion algorithm, as well as ideal-stabilizing leader election and local mutual exclusion.

Lecture Notes in Computer Science, 2010

Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanticipated physical events such as faults. Thus, constructing correct distributed systems has always been a challenge and often subject to serious errors. We present a methodology for component-based modeling, verification, and performance evaluation of self-stabilizing systems based on the BIP framework. In BIP, a system is modeled as the composition of a set of atomic components by using two types of operators: interactions describing synchronization constraints between components, and priorities to specify scheduling constraints. The methodology involves three steps illustrated using the distributed reset algorithm due to Arora and Gouda. First, a high-level model of the algorithm is built in BIP from the set of its processes by using powerful primitives for multi-party interactions and scheduling. Then, we use this model for verification of properties of a self-stabilizing algorithm including closure, deadlock-freedom, and finite reachability of the set of legitimate states. Finally, a distributed model which is observationally equivalent to the high-level model is generated. This model is used for performance analysis taking into account the degree of parallelism and convergence times for failure-free behavior as well as in the presence of faults.

SIAM Journal on Computing, 1997

Self-stabilizing message driven protocols are de ned and discussed. The class weakexclusion that contains many natural tasks such as `-exclusion and token-passing is dened, and it is shown that in any execution of any self-stabilizing protocol for a task in this class, the con guration size must grow at least in a logarithmic rate. This last lower bound is valid even if the system is supported by a time-out mechanism that prevents communication deadlocks. Then we present three self-stabilizing message driven protocols for token-passing. The rate of growth of con guration size for all three protocols matches the aforementioned lower bound. Our protocols are presented for two processor systems but can be easily adapted to rings of arbitrary size. Our results have an interesting interpretation in terms of automata theory.

Parallel Processing Letters, 2008

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.

IEICE Transactions on Information and Systems, 2009

A desired property of large distributed systems is self adaptability against the faults that occur more frequently as the size of the distributed system grows. Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing selfstabilizing protocols promise not only self-stabilization but also containment of faults (quick recovery and small effect) against small number of faults. However, existing composition techniques for self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing self-stabilizing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that provides a composition of multiple fault-containing selfstabilizing protocols while preserving the fault-containment property of the source protocols.