Distributed Chasing of Network Intruders by Mobile Agents. - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2008

Distributed Chasing of Network Intruders by Mobile Agents.


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.
Fichier principal
Vignette du fichier
BlinFNV08.pdf (1.08 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00341368 , version 1 (23-07-2009)



Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents.. Theoretical Computer Science, 2008, 399 (1-2), pp.12--37. ⟨10.1016/j.tcs.2008.02.004⟩. ⟨hal-00341368⟩
436 View
97 Download



Gmail Facebook Twitter LinkedIn More