Self-stabilization
View article
Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers Open
We consider the leader election problem in the population protocol model, which Angluin et al. proposed in 2004. A self-stabilizing leader election is impossible for complete graphs, arbitrary graphs, trees, lines, degree-bounded graphs, a…
View article
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits Open
This paper considers the basic $\\mathcal{PULL}$ model of communication, in\nwhich in each round, each agent extracts information from few randomly chosen\nagents. We seek to identify the smallest amount of information revealed in each\nin…
View article
Self-Stabilizing Distributed Cooperative Reset Open
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\nrese…
View article
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures Open
Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various prob…
View article
An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks Open
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2/3-approximation t…
View article
Self-stabilizing multivalued consensus in asynchronous crash-prone systems Open
The multivalued consensus problem is a fundamental issue in fault-tolerant distributed computing. It encompasses a wide range of agreement problems where processes must unanimously decide on a specific value v∈V, with |V|≥2. Existing solut…
View article
A Self-stabilizing 1-maximal Independent Set Algorithm Open
We consider the 1-maximal independent set (1-MIS) problem: given a graph G = (V, E), our goal is to find a 1-maximal independent set (1-MIS) of a given network G, that is, a maximal independent set (MIS) S ⊂ V of G such that S ∪ {v, w} ∖ {…
View article
Space-Optimal Naming in Population Protocols Open
The distributed naming problem, assigning unique names to the nodes in a distributed system, is a fundamental task. This problem is nontrivial, especially when the amount of memory available for the task is low, and when requirements for f…
View article
Self-Stabilizing Population Protocols With Global Knowledge Open
In the population protocol model, many problems cannot be solved in a self-stabilizing manner. However, global knowledge, such as the number of nodes in a network, sometimes enables the design of a self-stabilizing protocol for such proble…
View article
Computing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov Chains Open
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time starting from an arbitrary state, i.e., a state resulting from a sequence of faults. Considering the fact that these algorithms are intended …
View article
Self-stabilizing indulgent zero-degrading binary consensus Open
Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he showed that an arbitrary behavior of the failure detector never violates safety requirements even if it compromises liveness. Consensus implementations a…
View article
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols Open
We consider the leader election problem in the population protocol model. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom…
View article
Communication Efficient Self-Stabilizing Leader Election. Open
This paper presents a randomized self-stabilizing algorithm that elects a leader r in a general n-node undirected graph and constructs a spanning tree T rooted at r. The algorithm works under the synchronous message passing network model, …
View article
Near-optimal self-stabilising counting and firing squads Open
Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agr…
View article
Topological Self-Stabilization with Name-Passing Process Calculi Open
Topological self-stabilization is the ability of a distributed system to have its nodes themselves establish a meaningful overlay network. Independent from the initial network topology, it converges to the desired topology via forwarding, …
View article
A self-stabilizing distributed maximum flow algorithm Open
This thesis presents a self-stabilizing distributed maximum flow algorithm for a network G = (V, E), where V is a set of nodes in the network and E is a set of edges in the network. The algorithm has two phases: reset phase and preflow-pus…
View article
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms Open
Given a boolean predicate $\Pi$ on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for $\Pi$ is a distributed algorithm that can start from any initial configuration of the network (i.e., every…
View article
Self-stabilizing Total-order Broadcast Open
The problem of total-order (uniform reliable) broadcast is fundamental in fault-tolerant distributed computing since it abstracts a broad set of problems requiring processes to uniformly deliver messages in the same order in which they wer…
View article
Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings Open
Self-stabilization in distributed systems is a technique to guarantee convergence to a set of legitimate states without external intervention when a transient fault or bad initialization occurs. Recently, there has been a surge of efforts …
View article
Self-stabilization Overhead: an Experimental Case Study on Coded Atomic Storage Open
Shared memory emulation can be used as a fault-tolerant and highly available distributed storage solution or as a low-level synchronization primitive. Attiya, Bar-Noy, and Dolev were the first to propose a single-writer, multi-reader linea…
View article
Self-Stabilizing Supervised Publish-Subscribe Systems Open
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing sup…
View article
Near-Optimal Self-Stabilising Counting and Firing Squads Open
Consider a fully-connected synchronous distributed system consisting of $n$ nodes, where up to $f$ nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous $C$-counting problem, all nodes need to eventual…
View article
Automated Synthesis of Distributed Self-Stabilizing Protocols Open
In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms requi…
View article
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus Open
We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the n nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e., the initial state…
View article
Self-Stabilizing Clock Synchronization with 3-bit messages. Open
This paper studies the complexities of basic distributed computing tasks while operating under severe fault-tolerant contexts and strong communication constraints. We consider the self-stabilizing context, in which internal states of proce…
View article
On the Limits and Practice of Automatically Designing Self-Stabilization Open
A protocol is said to be self-stabilizing when the distributed system executing it is guaranteed to recover from any fault that does not cause permanent damage. Designing such protocols is hard since they must recover from all possible sta…
View article
Self-stabilizing Connected Components Open
For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilizati…
View article
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems Open
The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes have to uniformly decide on a specific value v in V, where…
View article
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits Open
This paper considers the basic $\mathcal{PULL}$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each intera…
View article
Self-stabilizing Reconfiguration Open
Current reconfiguration techniques are based on starting the system in a consistent configuration, in which all participating entities are in their initial state. Starting from that state, the system must preserve consistency as long as a …