ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0805.0851
88
6
v1v2 (latest)

Bounds for self-stabilization in unidirectional networks

7 May 2008
Samuel Bernard
Stéphane Devismes
M. Potop-Butucaru
Sébastien Tixeuil
ArXiv (abs)PDFHTML
Abstract

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time. Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. In this paper, we investigate the intrinsic complexity of achieving self-stabilization in unidirectional networks, and focus on the classical vertex coloring problem. When deterministic solutions are considered, we prove a lower bound of nnn states per process (where nnn is the network size) and a recovery time of at least n(n−1)/2n(n-1)/2n(n−1)/2 actions in total. We present a deterministic algorithm with matching upper bounds that performs in arbitrary graphs. When probabilistic solutions are considered, we observe that at least Δ+1\Delta + 1Δ+1 states per process and a recovery time of Ω(n)\Omega(n)Ω(n) actions in total are required (where Δ\DeltaΔ denotes the maximal degree of the underlying simple undirected graph). We present a probabilistically self-stabilizing algorithm that uses k\mathtt{k}k states per process, where k\mathtt{k}k is a parameter of the algorithm. When k=Δ+1\mathtt{k}=\Delta+1k=Δ+1, the algorithm recovers in expected O(Δn)O(\Delta n)O(Δn) actions. When k\mathtt{k}k may grow arbitrarily, the algorithm recovers in expected O(n) actions in total. Thus, our algorithm can be made optimal with respect to space or time complexity.

View on arXiv
Comments on this paper