Computational complexity of traffic hijacking under BGP and S-BGP
From MaRDI portal
Publication:496018
DOI10.1016/j.tcs.2015.07.038zbMath1329.68044arXiv1205.4564MaRDI QIDQ496018
Erlebach, Thomas, Maurizio Patrignani, Giuseppe Di Battista, Marco Chiesa
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4564
computational complexity; network protocols; BGP; hijacking attack; interception attack; interdomain routing; routing stability
68Q25: Analysis of algorithms and problem complexity
68M12: Network protocols
68M11: Internet topics