Robust Distributed Routing in Dynamical Networks - Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures
Name
Frazzoli_Robust distributed routing II.pdf
Size
404.1 KB
Format
Adobe PDF
Checksum (MD5)
ad03174041bcc754730f110a0ba07d33
Author(s)
Como, Giacomo
Savla, Ketan
Acemoglu, Daron
Dahleh, Munther A.
Frazzoli, Emilio
Date Issued
January 2013
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Como, Giacomo, Ketan Savla, Daron Acemoglu, Munther A. Dahleh, and Emilio Frazzoli. “Robust Distributed Routing in Dynamical Networks–Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures.” IEEE Transactions on Automatic Control 58, no. 2 (February 2013): 333-348.
Version
Original manuscript
Abstract
Strong resilience properties of dynamical networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the outflow at a non-destination node gets split among its outgoing links is allowed to depend only on local information about the current particle densities on the outgoing links. The strong resilience of the network is defined as the infimum sum of link-wise flow capacity reductions making the asymptotic total inflow to the destination node strictly less than the total outflow at the origin. A class of distributed routing policies that are responsive to local information is shown to yield the maximum possible strong resilience under such local information constraints for an acyclic dynamical network with a single origin-destination pair. The maximal achievable strong resilience is shown to be equal to the minimum node residual capacity of the network. The latter depends on the limit flow of the unperturbed network and is defined as the minimum, among all the non-destination nodes, of the sum, over all the links outgoing from the node, of the differences between the maximum flow capacity and the limit flow of the unperturbed network. We propose a simple convex optimization problem to solve for equilibrium flows of the unperturbed network that minimize average delay subject to strong resilience guarantees, and discuss the use of tolls to induce such an equilibrium flow in traffic networks. Finally, we present illustrative simulations to discuss the connection between cascaded failures and the resilience properties of the network.
Description
Original manuscript: March 25, 2011
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Economics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tac.2012.2209975
