Computational complexity of traffic hijacking under BGP and S-BGP (Q496018)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational complexity of traffic hijacking under BGP and S-BGP
scientific article

    Statements

    Computational complexity of traffic hijacking under BGP and S-BGP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    interdomain routing
    0 references
    routing stability
    0 references
    network protocols
    0 references
    BGP
    0 references
    hijacking attack
    0 references
    interception attack
    0 references
    computational complexity
    0 references
    0 references
    0 references