Distributed chasing of network intruders

  • Authors:

  • Lélia Blin;Pierre Fraigniaud;Nicolas Nisse;Sandrine Vial

  • Affiliations:

  • IBISC, University of Evry, Evry, France;CNRS, University Paris Diderot-Paris 7, Paris, France;DIM, Universidad of Chile, Santiago, Chile;PRiSM, University of Versailles-Saint Quentin, Versailles, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

Graph searching is one of the most popular tools for analyzing the chase for a powerful and hostile software agent (called the ''intruder''), by a set of software agents (called the ''searchers'') in a network. The existing solutions for the graph searching problem suffer however from a serious drawback: they are mostly centralized and assume a global synchronization mechanism for the searchers. In particular: (1) the search strategy for every network is computed based on the knowledge of the entire topology of the network, and (2) the moves of the searchers are controlled by a centralized mechanism that decides at every step which searcher has to move, and what movement it has to perform. 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 using a strategy computed in the centralized and synchronous setting.