We introduce, as an enhancement of self-stabilization, the concept of monotonic self-
stabilization for distributed systems that ensures that a certain measure of quality of state …

The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time
starting from an arbitrary state, ie, a state resulting from a sequence of faults. Considering …

In this paper, we focus on the implementation of distributed programs in using a key-value
store where the state of the nodes is stored in a replicated and partitioned data store to …

A self-stabilizing system tolerates any transient faults and does not need any initialization. In
wireless ad-hoc networks, a connected dominating set is the graph-theoretic counterpart of a …

Rapid growth in the number of users, devices and applications and infrastructures
generating and demanding massive amount of content traffic on the Internet has …

The analysis of self-stabilizing algorithms is in the vast majority of all cases limited to the
worst case stabilization time starting from an arbitrary configuration. Considering the fact that …

In this paper, we propose the first self-stabilizing c-wave algorithm for broadcasting large
size messages from multiple initiator processes such that every process receives at least …

Propagation safety and propagation reliability, are important building blocks for secure
network protocols, defense and safety mechanisms, and command and control systems …

Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial
task. This paper introduces a new method which allows to extend proofs for the central …

In this paper, we evaluate and compare the performance of two approaches, namely self-
stabilization and rollback, to handling consistency violating faults (\cvf) that occur when a self …