Robust Network Routing under Cascading Failures
Name
Dahleh_Robust network.pdf
Size
567.4 KB
Format
Adobe PDF
Checksum (MD5)
ea4d75b6e94f2ffd94e37db5a643fc86
Author(s)
Savla, Ketan
Como, Giacomo
Dahleh, Munther A.
Date Issued
November 2014
Journal
IEEE Transactions on Network Science and Engineering
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Savla, Ketan, Giacomo Como, and Munther A. Dahleh. “Robust Network Routing Under Cascading Failures.” IEEE Trans. Netw. Sci. Eng. 1, no. 1 (January 1, 2014): 53–66.
Version
Original manuscript
Abstract
We propose a dynamical model for cascading failures in single-commodity network flows. In the proposed model, the network state consists of flows and activation status of the links. Network dynamics is determined by a, possibly state-dependent and adversarial, disturbance process that reduces flow capacity on the links, and routing policies at the nodes that have access to the network state, but are oblivious to the presence of disturbance. Under the proposed dynamics, a link becomes irreversibly inactive either due to overload condition on itself or on all of its immediate downstream links. The coupling between link activation and flow dynamics implies that links to become inactive successively are not necessarily adjacent to each other, and hence the pattern of cascading failure under our model is qualitatively different than standard cascade models. The magnitude of a disturbance process is defined as the sum of cumulative capacity reductions across time and links of the network, and the margin of resilience of the network is defined as the infimum over the magnitude of all disturbance processes under which the links at the origin node become inactive. We propose an algorithm to compute an upper bound on the margin of resilience for the setting where the routing policy only has access to information about the local state of the network. For the limiting case when the routing policies update their action as fast as network dynamics, we identify sufficient conditions on network parameters under which the upper bound is tight under an appropriate routing policy. Our analysis relies on making connections between network parameters and monotonicity in network state evolution under proposed dynamics.
MIT Department
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TNSE.2014.2373358
