TY - GEN
T1 - On the Induction of Cascading Failures in Transportation Networks
AU - Kearney, Griffin
AU - Fardad, Makan
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - We examine the effect of malicious attacks in disrupting optimal routing algorithms for transportation networks. We model traffic networks using the cell transmission model, which is a spatiotemporal discretization of kinematic wave equations. Here, vehicles are modeled as masses and roads as cells, and traffic flow is subject to conservation of mass and capacity constraints. At time zero a resource-constrained malicious agent reduces the capacities of cells so as to maximize the amount of time mass spends in the network. For the resulting set of capacities the network router then solves a linear program to determine the flow configuration that minimizes the amount of time mass spends in the network. Our model allows for the outright or partial failure of road cells at time zero, the effects of which can cause cascading failure in the network due to irreversible blockages resulting from congestion. This two-player problem is written as a max-min optimization and is reformulated to an equivalent nonconvex optimization problem with a bilinear objective and linear constraints. Linearization techniques are applied to the optimization problem to find local solutions. Analyzing illustrative examples shows that attackers with relatively small resource budgets can cause widespread failure in a traffic network.
AB - We examine the effect of malicious attacks in disrupting optimal routing algorithms for transportation networks. We model traffic networks using the cell transmission model, which is a spatiotemporal discretization of kinematic wave equations. Here, vehicles are modeled as masses and roads as cells, and traffic flow is subject to conservation of mass and capacity constraints. At time zero a resource-constrained malicious agent reduces the capacities of cells so as to maximize the amount of time mass spends in the network. For the resulting set of capacities the network router then solves a linear program to determine the flow configuration that minimizes the amount of time mass spends in the network. Our model allows for the outright or partial failure of road cells at time zero, the effects of which can cause cascading failure in the network due to irreversible blockages resulting from congestion. This two-player problem is written as a max-min optimization and is reformulated to an equivalent nonconvex optimization problem with a bilinear objective and linear constraints. Linearization techniques are applied to the optimization problem to find local solutions. Analyzing illustrative examples shows that attackers with relatively small resource budgets can cause widespread failure in a traffic network.
KW - Traffic network
KW - cascading failures
KW - flow networks
KW - network interdiction
UR - http://www.scopus.com/inward/record.url?scp=85062181136&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062181136&partnerID=8YFLogxK
U2 - 10.1109/CDC.2018.8619519
DO - 10.1109/CDC.2018.8619519
M3 - Conference contribution
AN - SCOPUS:85062181136
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 1821
EP - 1826
BT - 2018 IEEE Conference on Decision and Control, CDC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 57th IEEE Conference on Decision and Control, CDC 2018
Y2 - 17 December 2018 through 19 December 2018
ER -