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.
Liste complète des métadonnées

Contributeur : Frédéric Davesne <>
Soumis le : jeudi 23 juillet 2009 - 02:11:10
Dernière modification le : lundi 5 novembre 2018 - 15:36:03
Document(s) archivé(s) le : lundi 7 juin 2010 - 23:20:26


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00341368, version 1


Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents.. Theoretical Computer Science, Elsevier, 2008, 399, pp.12--37. 〈hal-00341368〉



Consultations de la notice


Téléchargements de fichiers