Searching for a black hole in tree networks

Jurek Czyzowicz, Dariusz Kowalski, Euripides Markou, Andrzej Pelc

Research output: Contribution to journalConference article

Abstract

A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given tree and given starting node we are interested in the fastest possible black hole search by two agents. For arbitrary trees we give a 5/3-approximation algorithm for this problem. We give optimal black hole search algorithms for two "extreme" classes of trees: the class of lines and the class of trees in which any internal node (including the root which is the starting node) has at least 2 children.

Original languageEnglish (US)
Pages (from-to)67-80
Number of pages14
JournalLecture Notes in Computer Science
Volume3544
StatePublished - Oct 17 2005
Externally publishedYes
Event8th International Conference on Principles of Distributed Systems, OPODIS 2004 - Grenoble, France
Duration: Dec 15 2004Dec 17 2004

Fingerprint

Tree Networks
Mobile agents
Approximation algorithms
Black Holes
Vertex of a graph
Mobile Agent
Stationary Process
Search Algorithm
Approximation Algorithms
Extremes
Trace
Roots
Upper bound
Internal
Line
Arbitrary
Class

Keywords

  • Algorithm
  • Black hole
  • Mobile agent
  • Tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2005). Searching for a black hole in tree networks. Lecture Notes in Computer Science, 3544, 67-80.

Searching for a black hole in tree networks. / Czyzowicz, Jurek; Kowalski, Dariusz; Markou, Euripides; Pelc, Andrzej.

In: Lecture Notes in Computer Science, Vol. 3544, 17.10.2005, p. 67-80.

Research output: Contribution to journalConference article

Czyzowicz, J, Kowalski, D, Markou, E & Pelc, A 2005, 'Searching for a black hole in tree networks', Lecture Notes in Computer Science, vol. 3544, pp. 67-80.
Czyzowicz J, Kowalski D, Markou E, Pelc A. Searching for a black hole in tree networks. Lecture Notes in Computer Science. 2005 Oct 17;3544:67-80.
Czyzowicz, Jurek ; Kowalski, Dariusz ; Markou, Euripides ; Pelc, Andrzej. / Searching for a black hole in tree networks. In: Lecture Notes in Computer Science. 2005 ; Vol. 3544. pp. 67-80.
@article{1519ac6a430a42988fcd43206719e801,
title = "Searching for a black hole in tree networks",
abstract = "A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given tree and given starting node we are interested in the fastest possible black hole search by two agents. For arbitrary trees we give a 5/3-approximation algorithm for this problem. We give optimal black hole search algorithms for two {"}extreme{"} classes of trees: the class of lines and the class of trees in which any internal node (including the root which is the starting node) has at least 2 children.",
keywords = "Algorithm, Black hole, Mobile agent, Tree",
author = "Jurek Czyzowicz and Dariusz Kowalski and Euripides Markou and Andrzej Pelc",
year = "2005",
month = "10",
day = "17",
language = "English (US)",
volume = "3544",
pages = "67--80",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Searching for a black hole in tree networks

AU - Czyzowicz, Jurek

AU - Kowalski, Dariusz

AU - Markou, Euripides

AU - Pelc, Andrzej

PY - 2005/10/17

Y1 - 2005/10/17

N2 - A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given tree and given starting node we are interested in the fastest possible black hole search by two agents. For arbitrary trees we give a 5/3-approximation algorithm for this problem. We give optimal black hole search algorithms for two "extreme" classes of trees: the class of lines and the class of trees in which any internal node (including the root which is the starting node) has at least 2 children.

AB - A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given tree and given starting node we are interested in the fastest possible black hole search by two agents. For arbitrary trees we give a 5/3-approximation algorithm for this problem. We give optimal black hole search algorithms for two "extreme" classes of trees: the class of lines and the class of trees in which any internal node (including the root which is the starting node) has at least 2 children.

KW - Algorithm

KW - Black hole

KW - Mobile agent

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=26444573149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26444573149&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:26444573149

VL - 3544

SP - 67

EP - 80

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -