MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Robust distributed routing in dynamical networks with cascading failures

Author(s)
Como, Giacomo; Acemoglu, Daron; Dahleh, Munther A.; Frazzoli, Emilio; Savla, Ketan D.
Thumbnail
DownloadFrazzoli_Robust distributed.pdf (117.4Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
We consider a dynamical formulation of network flows, whereby the network is modeled as a switched system of ordinary differential equations derived from mass conservation laws on directed graphs with a single origin-destination pair and a constant inflow at the origin. The rate of change of the density on each link of the network equals the difference between the inflow and the outflow on that link. The inflow to a link is determined by the total flow arriving to the tail node of that link and the routing policy at that tail node. The outflow from a link is modeled to depend on the current density on that link through a flow function. Every link is assumed to have finite capacity for density and the flow function is modeled to be strictly increasing up to the maximum density. A link becomes inactive when the density on it reaches the capacity. A node fails if all its outgoing links become inactive, and such node failures can propagate through the network due to rerouting of flow. We prove some properties of these dynamical networks and study the resilience of such networks under distributed routing policies with respect to perturbations that reduce link-wise flow functions. In particular, we propose an algorithm to compute upper bounds on the maximum resilience over all distributed routing policies, and discuss examples that highlight the role of cascading failures on the resilience of the network.
Date issued
2012-12
URI
http://hdl.handle.net/1721.1/81862
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
Journal
Proceedings of the 2012 51st IEEE Conference on Decision and Control (CDC)
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 with cascading failures.” In 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 7413-7418. Institute of Electrical and Electronics Engineers, 2012.
Version: Author's final manuscript
ISBN
978-1-4673-2066-5
978-1-4673-2065-8
978-1-4673-2063-4
978-1-4673-2064-1

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.