Computational Complexity of Traffic Hijacking under BGP and S-BGP

DOI10.1007/978-3-642-31585-5_43zbMath1367.68107OpenAlexW2788918638MaRDI QIDQ3167036

Maurizio Patrignani, Marco Chiesa, Giuseppe Di Battista, Erlebach, Thomas

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network protocols (68M12) Internet topics (68M11)

Related Items (1)

Computational complexity of traffic hijacking under BGP and S-BGP

This page was built for publication: Computational Complexity of Traffic Hijacking under BGP and S-BGP