Self-Stabilizing Depth-First Search

@article{Collin1994SelfStabilizingDS,
  title={Self-Stabilizing Depth-First Search},
  author={Zeev Collin and S. Dolev},
  journal={Inf. Process. Lett.},
  year={1994},
  volume={49},
  pages={297-301}
}
Abstract A distributed algorithm is self-stabilizing if it can be started from any possible global state. Once started, the algorithm converges to a consistent global state by itself. This paper presents a distributed self-stabilizing Depth-First Search (DFS) spanning tree algorithm, whose output is a DFS spanning tree of the communication graph, kept in a distributed fashion. 
A Self-stabilizing Distributed Algorithm to Find the Center of a Tree Graph
TLDR
The self-stabilization of the distributed algorithm is proved using mathematical induction; the algorithm did not need to design a bounded function on the global state (which is customary for proving correctness of self-Stabilizing algorithms). Expand
A Self-Stabilizing Algorithm for Minimum-Depth Search of Graphs
TLDR
It has been proved that the algorithm is correct and requires O( n 2 ) time, where n is the number of nodes of the graph and the algorithm produces a minimum-depth spanning tree (MDST) of the given graph in a distributed manner. Expand
A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms
TLDR
This paper surveys self-stabilizing algorithms that construct a spanning tree within a network of processing entities to find those that are well-suited for dynamic, failure prone environments. Expand
A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
TLDR
A linear time self-stabilizing algorithm for detecting the set offamental cycles on an undirected connected graph modelling asynchronous distributed system and it is proved that this one stabilizes after O(n) moves. Expand
A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
TLDR
This paper presents a linear time quasi self-stabilizing algorithm for detecting the set of fundamental cycles on an undirected connected graph modeling asynchronous distributed system and proves that it stabilizes after O(n) moves. Expand
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
TLDR
A self-stabilizing algorithm for computing the median in a given tree graph is proposed and the correctness of the proposed algorithm is shown by using a new technique involving induction. Expand
A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges
TLDR
This paper will prove that the composition of the algorithm with any silent self-stabilizing DFS algorithm is self-Stabilizing, and show that the algorithm needs O(n2) moves to reach a terminal configuration once the DFS spanning tree is computed. Expand
Snap-Stabilizing Depth-First Search on Arbitrary Networks
TLDR
This paper presents a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks that is proven assuming an unfair daemon, i.e., assuming the weakest scheduling assumption. Expand
Snap-Stabilizing Depth-First Search on Arbitrary Networks
TLDR
This paper presents the first snap-stabilizing depth-first search wave protocol for arbitrary rooted networks assuming an unfair daemon, i.e. assuming the weakest scheduling assumption. Expand
A Self-Stabilizing Algorithm for Maximum Matching in Trees
TLDR
This paper presents a distributed, self-stabilizing algorithm for constructing a maximum matching in trees that does not require any initialization and is tolerant to transient faults. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
A New Distributed Depth-First-Search Algorithm
TLDR
A new distributed Depth-First-Search (DFS) algorithm for an asynchronous communication network, whose communication and time complexities are O(|E|) and O( |V|), respectively. Expand
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
TLDR
This work presents three dynamic, uniform, self-stabilizing protocols for leader election: the first protocol works on complete graphs, the second protocol works for systems with unbounded number of processor in which the size of the memory of a processor is unbounded, and the third protocol work for systems whose communication graph has a bounded diameter. Expand
Uniform Self-Stabilizing Rings
TLDR
It is shown that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime, and a refined protocol is given which uses only Θ(n2/ln n) states. Expand
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
TLDR
Three self-stabilizing protocols for distributed systems in the shared memory model are presented, one of which is a mutual-exclusion prootocol for tree structured systems, and another is a spanning tree protocol for systems with any connected communication graph. Expand
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
  • T. Cheung
  • Computer Science
  • IEEE Trans. Software Eng.
  • 1983
This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design ofExpand
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design ofExpand
Self-stabilization of dynamic systems assuming only read/write atomicity
TLDR
Three self-stabilizing protocols for distributed systems in the shared memory model are presented, one of which is a mutual-exclusion prootocol for tree structured systems and the other two are a spanning tree protocol for systems with any connected communication graph. Expand
Resource bounds for self stabilizing message driven protocols
TLDR
The class weakexclusion that contains many natural tasks such as `-exclusion and token-passing is defined, and it is shown that in any execution of any self-stabilizing protocol for a task in this class, the configuration size must grow in a logarithmic rate. Expand
Distributed Reset
TLDR
A reset subsystem is designed that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary, and is very robust: it can tolerate fail-stop failures and repairs of processes and channels, even when a reset is in progress. Expand
Self-stabilizing extensions for message-passing systems
TLDR
This paper explores the possibility of extending an arbitrary program into a self-stabilizing one using an asynchronous distributed message-passing system whose communication topology is an arbitrary graph. Expand
...
1
2
...