Efficient self-stabilizing graph searching in tree networks

Authors:
Jean Blair;Fredrik Manne;Rodica Mihai
Affiliations:
Department of EE and CS, United States Military Academy, West Point, NY;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Year:
2010

Citing 8
Cited 0

The vertex separation number of a graph equals its path-width

Information Processing Letters
Tree-width, path-width, and cutwidth

Discrete Applied Mathematics
Edge and node searching problems on trees

Theoretical Computer Science - computing and combinatorics
Efficient Self-stabilizing Algorithms for Tree Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
A Distributed Algorithm for Computing and Updating the Process Number of a Forest

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Self-stabilizing Algorithm for Graph Searching in Trees

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The graph search problem asks for a strategy that enables a minimum sized team of searchers to capture a "fugitive" while it evades and potentially multiplies through a network. It is motivated by the need to eliminate fast spreading viruses and other malicious software agents in computer networks. The current work improves on previous results with a self-stabilizing algorithm that clears an n node tree network using only 1+log n searchers and O(n log n) moves after initialization. Since Θ(log n) searchers are required to clear some tree networks even in the sequential case, this is the best that any self-stabilizing algorithm can do. The algorithm is based on a novel multi-layer traversal of the network.