Self-stabilizing (f, g)-alliances with safe convergence

  title={Self-stabilizing (f, g)-alliances with safe convergence},
  author={Fabienne Carrier and Ajoy Kumar Datta and St{\'e}phane Devismes and Lawrence L. Larmore and Yvan Rivierre},
  booktitle={J. Parallel Distributed Comput.},

Self-Stabilizing Algorithm for Maximal 2-Packing with Safe Convergence in an Arbitrary Graph

A safely converging self-stabilizing algorithm for maximal 2-packing problem that quickly converges to a safe state, not necessarily the legitimate state, and then terminates in a maximal one in O(n) steps without breaking safety during the convergence interval, where n is the number of nodes.

Self-Stabilizing Distributed Cooperative Reset

This work proposes 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 and their time complexity is better than that of previous ones.

Silent self-stabilizing scheme for spanning-tree-like constructions

The versatility of the approach is illustrated by proposing several such instantiations that efficiently solve classical problems such as leader election, as well as, unconstrained and shortest-path spanning tree constructions.

Self-stabilizing algorithm for minimal (α,β)-dominating set

A generalized self-stabilizing algorithm called minimal -dominating set is introduced and it is proved rigorously the correctness of the case f and the efficiency of the proposed algorithm.

A Self-Stabilizing Algorithm for the Local (1,|Ni|)-Critical Section Problem with Safe Convergence

  • S. KameiH. Kakugawa
  • Mathematics
    2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  • 2019
In this paper, a self-stabilizing distributed algorithm for the local (1,|Ni|)-CS problem with safe convergence is proposed, and it is assumed that the feasible legitimate configuration satisfies the condition that a dominating set is constructed, and the optimal legitimate configuration satisfying the conditions that two disjoint dominating sets are constructed and maintained dynamically.

Fault Tolerance in Distributed Systems Using Self-Stabilization

Three new self-stabilizing algorithms are proposed to compute a minimal weakly connected dominating set in the arbitrary network graph under different models; they outperform the best possible solution existing in the literature.

Gradual Stabilization under (cid:28) -Dynamics

A self-stabilizing algorithm is proposed which achieves gradual stabilization in the sense that after one dynamic step from a configuration which is legitimate for the strong unison, it immediately satisfles the speci⬁cation of partial weak unison, then converges to theSpeci�akcation of weak unison in at most one round.

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions

This work proposes a general scheme to compute tree-based data structures on arbitrary networks that is self-stabilizing, silent, and despite its generality, also efficient, and a significant set of instantiations of this scheme requires only bounded memory space per process.

Algorithmes auto-stabilisants pour la construction de structures couvrantes réparties. (Self-Stabilizing Algorithms for Constructing Distributed Spanning Structures)

This thesis deals with the self-stabilizing construction of spanning structures over a distributed system and aims for the weakest possible assumptions, such as arbitrary topologies, in order to propose the most versatile constructions of distributed spanning structures.



A Self-stabilizing Algorithm for Finding a Minimal K-Dominating Set in General Networks

This paper proposes a self-stabilizing algorithm for the minimal k-dominating set (MKDS) under a central daemon model when operating in any general network and proves that the worst case convergence time of the algorithm from any arbitrary initial state is O(n 2) steps.

An Asynchronous Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs

This paper proposes the first asynchronous self-stabilizing (6 + e)-approximation algorithm with safe convergence for the minimum CDS in the networks modeled by unit disk graphs.

A self-stabilizing minimal dominating set algorithm with safe convergence

  • H. KakugawaT. Masuzawa
  • Computer Science
    Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006
This paper proposes a minimal independent dominating set algorithm with safe convergence property, which guarantees that a system quickly converges to a safe configuration, and then, it gracefully moves to an optimal configuration without breaking safety.

Uniform Dynamic Self-Stabilizing Leader Election

This work introduces self-stabilizing protocols for synchronization that are used as building blocks by the leader-election algorithm and presents a simple, uniform, self-Stabilizing ranking protocol.

On defensive alliances and line graphs

A lower bound on dynamic k-stabilization in asynchronous systems

  • C. GenoliniS. Tixeuil
  • Computer Science, Mathematics
    21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings.
  • 2002
It is shown that the well known step complexity model is not appropriate to study time complexity of time-adaptive protocols (i.e. protocols that recover from memory corruption in a time that depends only on the number of faults and not on the network size).

The South Zone: Distributed Algorithms for Alliances

Novel results on and efficient deterministic as well as randomized synchronous message-passing distributed algorithms for generalized graph alliances, a new concept incorporating and expanding previous ones, interested in finding minimal alliances of generalized type.

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

The computational power of population protocols

It is proved that all predicates stably computable in this model of population protocols (and certain generalizations of it) are semilinear, answering a central open question about the power of the model.