Snap-Stabilizing Depth-First Search on Arbitrary Networks

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 sche...

Full description

Saved in:

Bibliographic Details
Published in:	Computer journal Vol. 49; no. 3; pp. 268 - 280
Main Author:	Cournier, A.
Format:	Journal Article
Language:	English
Published:	Oxford Oxford Publishing Limited (England) 01-05-2006 Oxford University Press (UK)
Subjects:	Algorithms Communication Computer Science Distributed network protocols Information systems Protocol Scheduling Variables
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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. [PUBLICATION ABSTRACT]
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0010-4620 1460-2067 0010-4620
DOI:	10.1093/comjnl/bxh154