Distributed Chasing of Network Intruders

DOI10.1007/11780823_7MaRDI QIDQ3613645zbMATH OpenOpenAlexFDO

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

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_7

Mathematics Subject Classification ID

Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Distributed chasing of network intruders
• INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
• scientific article; zbMATH DE number 5244563
• Distributed Detection in the Presence of Byzantine Attacks
• Distributed Detection: Finite-Time Analysis and Impact of Network Topology

Cited in

(8)

• Graph searching with advice
• Contiguous search problem in Sierpiński graphs
• The cost of monotonicity in distributed graph searching
• INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
• An annotated bibliography on guaranteed graph searching
• Distributed chasing of network intruders
• Capturing an intruder in product networks

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 Q3613645)