Snap-Stabilizing Depth-First Search on Arbitrary Networks

A. Cournier
2005 Computer journal  
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After the end of the visit, the root eventually detects the termination of the process. Furthermore, our
more » ... ol is proven assuming an unfair daemon, i.e., assuming the weakest scheduling assumption.
doi:10.1093/comjnl/bxh154 fatcat:gualup7wsnckhodz6eb5vc5v2u