Fundamental limit of network flow attacks

A network flow-based attack refers to a cyber-attack where the adversary seeks to block user traffic from transmission by sending adversarial traffic that reduces the available user capacity. In this thesis, we explore the fundamental limits of network flow attacks by investigating its feasibility region defined by the minimum resource required for a successful attack and designing optimal attacking strategies that achieve the feasibility region. First, we consider the case where the target network uses fixed-path routing and the adversary injects traffic into the network, encroaching the capacity of the network links and thus reducing the capacity available to network users on the fixed paths. We propose a new network interdiction paradigm that captures this phenomenon by modeling the network as a capacitated graph with the user throughput given by the max-flow value on the fixed user paths.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Aeronautics and Astronautics

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2019

Author dc:creator

• Fu, Xinzhe.

Advisor dc:contributor.advisor

• Eytan Modiano.

• Aeronautics and Astronautics.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/122412

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/122412