Snap-Stabilizing Depth-First Search on Arbitrary Networks

Authors:
Alain Cournier;Stéphane Devismes;Franck Petit;Vincent Villain
Affiliations:
LaRIA, CNRS FRE 2733, Universit de Picardie Jules Verne Amiens (France);*Corresponding author: devismes@laria.u-picardie.fr;LaRIA, CNRS FRE 2733, Universit de Picardie Jules Verne Amiens (France);LaRIA, CNRS FRE 2733, Universit de Picardie Jules Verne Amiens (France)
Venue:
The Computer Journal
Year:
2006

Citing 0
Cited 5

Light enabling snap-stabilization of fundamental protocols

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Snap-stabilizing waves in anonymous networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Distributed error confinement

ACM Transactions on Algorithms (TALG)
Snap-stabilization in message-passing systems

Journal of Parallel and Distributed Computing
The first fully polynomial stabilizing algorithm for BFS tree construction

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present the first snap-stabilizing depth-first search wave protocol for arbitrary rooted networks assuming an unfair daemon, i.e. assuming the weakest scheduling assumption (a preliminary version of this work was presented in OPODIS 2004, 8th International Conference on Principles of Distributed Systems, Grenoble (France)).