On the Induction of Cascading Failures in Transportation Networks

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.

[1]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[2]  Munther A. Dahleh,et al.  Robust Network Routing under Cascading Failures , 2014, IEEE Transactions on Network Science and Engineering.

[3]  Munther A. Dahleh,et al.  Robust Distributed Routing in Dynamical Networks - Part I: Locally Responsive Policies and Weak Resilience , 2013, IEEE Trans. Autom. Control..

[4]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[5]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[6]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[7]  Giacomo Como,et al.  Throughput Optimality and Overload Behavior of Dynamical Flow Networks Under Monotone Distributed Routing , 2013, IEEE Transactions on Control of Network Systems.

[8]  Giacomo Como,et al.  Convex formulations of dynamic network traffic assignment for control of freeway networks , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Munther A. Dahleh,et al.  Robust Distributed Routing in Dynamical Networks–Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures , 2013, IEEE Transactions on Automatic Control.

[10]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[11]  Mark S. Granovetter Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[12]  Makan Fardad,et al.  On a linear programming approach to the optimal seeding of cascading failures , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[13]  Munther A. Dahleh,et al.  Robust distributed routing in dynamical networks with cascading failures , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[14]  C. Daganzo THE CELL TRANSMISSION MODEL.. , 1994 .

[15]  Makan Fardad,et al.  On a framework for analysis and design of cascades on Boolean networks , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[16]  E. Rogers,et al.  Diffusion of innovations , 1964, Encyclopedia of Sport Management.