Loading...

Capturing an intruder in product networks

Imani, N ; Sharif University of Technology | 2006

195 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/11945918_23
  3. Publisher: 2006
  4. Abstract:
  5. In this paper, we envision a solution to the problem of capturing an intruder in a product network. This solution is derived based on the assumed existing algorithms for basic member graphs of a graph product. In this problem, a team of cleaner agents are responsible for capturing a hostile intruder in the network. While the agents can move in the network one hop at a time, the intruder is assumed to be arbitrarily fast in a way that it can traverse any number of nodes contiguously as far as no agents reside in those nodes. Here, we consider a version of the problem where each agent can replicate new agents. Hence, the algorithm start with a single agent and new agents are created on demand. © 2006 Springer-Verlag
  6. Keywords:
  7. Graph product ; On-Demand ; Product networks ; Single-agent
  8. Source: 13th International Conference on High Performance Computing, HiPC 2006, Bangalore, 18 December 2006 through 21 December 2006 ; Volume 4297 LNCS , 2006 , Pages 193-204 ; 03029743 (ISSN); 354068039X (ISBN); 9783540680390 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F11945918_23