Distributed Chasing of Network Intruders

DOI10.1007/11780823_7zbMATH Open1222.68122OpenAlexW4235450614MaRDI QIDQ3613645FDOQ3613645

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
• An annotated bibliography on guaranteed graph searching
• Graph searching with advice
• INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
• Distributed chasing of network intruders
• Contiguous search problem in Sierpiński graphs
• 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)