Distributed chasing of network intruders

DOI10.1016/J.TCS.2008.02.004MaRDI QIDQ930899zbMATH OpenOpenAlexFDO

Authors Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial

Publication date 24 June 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.02.004

zbMATH Keywords

distributed algorithmgraph searchingnetwork security

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Distributed Chasing of Network Intruders
• The cost of monotonicity in distributed graph searching
• Exclusive graph searching
• Searching for an evader in an unknown graph by an optimal number of searchers
• Graph Searching with Advice

Cites work

• scientific article; zbMATH DE number 1670677 (Why is no real title available?)
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 2006651 (Why is no real title available?)
• scientific article; zbMATH DE number 1775412 (Why is no real title available?)
• scientific article; zbMATH DE number 2119714 (Why is no real title available?)
• Algorithms and Computation
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automaten in planaren Graphen
• Complexity of Finding Embeddings in a k-Tree
• Connected Treewidth and Connected Graph Searching
• Graph exploration by a finite automaton
• Improved approximation algorithms for minimum-weight vertex separators
• Interval graphs and searching
• Mathematical Foundations of Computer Science 2005
• Monotonicity in graph searching
• On minimizing width in linear layouts
• Recontamination does not help to search a graph
• STACS 2004
• Searching and pebbling
• Searching for a black hole in arbitrary networks, optimal mobile agent protocols
• Searching is not jumping.
• Space Lower Bounds for Maze Threadability on Restricted Machines
• The complexity of searching a graph
• Undirected ST-connectivity in log-space

Cited in

(17)

• Distributed graph searching with a sense of direction
• The cost of monotonicity in distributed graph searching
• Intruder Capture in Sierpiński Graphs
• On-line search in two-dimensional environment
• Cops and Robbers on Dynamic Graphs: Offline and Online Case
• Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents
• On mobile agent verifiable problems
• Connected graph searching
• Finding small-width connected path decompositions in polynomial time
• Network decontamination under m-immunity
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
• Distributed Chasing of Network Intruders
• More agents may decrease global work: a case in butterfly decontamination
• Capturing an intruder in product networks
• Contiguous search problem in Sierpiński graphs
• Capturing an Intruder in the Pyramid

This page was built for publication: Distributed chasing of network intruders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930899)