Distributed Chasing of Network Intruders by Mobile Agents

Abstract : This paper addresses the graph searching problem in a distributed setting.We describe a distributed protocol that enables searchers with logarithmic size memory to clear any network, in a fully decentralized manner. The search strategy for the network in which the searchers are launched is computed online by the searchers themselves without knowing the topology of the network in advance. It performs in an asynchronous environment, i.e., it implements the necessary synchronization mechanism in a decentralized manner. In every network, our protocol performs a connected strategy using at most k + 1 searchers, where k is the minimum number of searchers required to clear the network in a monotone connected way, computed in the centralized and synchronous setting.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00342000
Contributor : Frédéric Davesne <>
Submitted on : Thursday, July 23, 2009 - 2:06:29 AM
Last modification on : Monday, October 1, 2018 - 4:36:02 PM
Long-term archiving on : Monday, June 7, 2010 - 11:26:32 PM

File

BlinFNV06b.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents. Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, United Kingdom. pp.70--84, ⟨10.1007/11780823_7⟩. ⟨hal-00342000⟩

Share

Metrics

Record views

301

Files downloads

59