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.
Original language | English |
---|---|
Pages (from-to) | 297-301 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 49 |
Issue number | 6 |
DOIs | |
State | Published - 22 Mar 1994 |
Externally published | Yes |
Keywords
- Distributed computing
- Fault tolerance
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications