Skip to Main content Skip to Navigation
Journal articles

Distributed Chasing of Network Intruders by Mobile Agents.

Lélia Blin 1 Pierre Fraigniaud 2 Nicolas Nisse 2, 3 Sandrine Vial 1 
3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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 metadata
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Thursday, July 23, 2009 - 2:11:10 AM
Last modification on : Thursday, August 4, 2022 - 4:52:44 PM
Long-term archiving on: : Monday, June 7, 2010 - 11:20:26 PM


Files produced by the author(s)



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



Record views


Files downloads