Robust distributed routing in dynamical networks with cascading failures

@article{Como2012RobustDR,
  title={Robust distributed routing in dynamical networks with cascading failures},
  author={Giacomo Como and Ketan Savla and Daron Acemoglu and Munther A. Dahleh and Emilio Frazzoli},
  journal={2012 IEEE 51st IEEE Conference on Decision and Control (CDC)},
  year={2012},
  pages={7413-7418}
}
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… 

Figures from this paper

On resilience of distributed routing in networks under cascade dynamics

A backward propagation algorithm is proposed to compute an upper bound on the margin of resilience for tree-like network topologies with breadth at most 2, and it is shown that this bound is tight for trees with the additional property of having depth at least 2.

Throughput optimal distributed routing in dynamical flow networks

A class of distributed routing policies is shown to be throughput optimal for single-commodity dynamical flow networks and it is proven that, if no cut capacity constraint is violated by the external inflow, then a globally asymptotically stable equilibrium exists and the network achieves maximal throughput.

Robust Distributed Routing in Dynamical Networks–Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures

A simple convex optimization problem is proposed to solve for equilibrium flows of the unperturbed network that minimize average delay subject to strong resilience guarantees, and the use of tolls to induce such an equilibrium flow in traffic networks is discussed.

Throughput Optimality and Overload Behavior of Dynamical Flow Networks Under Monotone Distributed Routing

Under monotonicity assumptions on the routing policies, it is proven that, if the external inflow at the origin nodes does not violate any cut capacity constraints, then there exists a globally asymptotically stable equilibrium, and the network achieves maximal throughput.

On the Induction of Cascading Failures in Transportation Networks

This 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.

Sheaf-theoretic framework for optimal network control.

This paper uses tools from sheaf theory to model and analyze optimal network control problems and their associated discrete relaxations, and provides a general bound for the error incurred by such a discretization process.

AFRL-AFOSR-VA-TR-2015-0387 (MURI-09) DISTRIBUTED LEARNING AND INFORMATION DYNAMICS IN NETWORKED AUTONOMOUS

This project is motivated by the need to enable advanced operations of teams of autonomous vehicles to learn and adapt to uncertain and hostile environments under effective utilization of

References

SHOWING 1-10 OF 15 REFERENCES

Robust Distributed Routing in Dynamical Networks—Part I: Locally Responsive Policies and Weak Resilience

Robust Distributed Routing in Dynamical Networks–Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures

A simple convex optimization problem is proposed to solve for equilibrium flows of the unperturbed network that minimize average delay subject to strong resilience guarantees, and the use of tolls to induce such an equilibrium flow in traffic networks is discussed.

A simple model of global cascades on random networks

  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but anincreasingly heterogeneous degree distribution makes it less vulnerable.

Model for cascading failures in complex networks.

It is shown that the breakdown of a single node is sufficient to collapse the efficiency of the entire system if the node is among the ones with largest load.

Cascade-based attacks on complex networks.

  • A. MotterY. Lai
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
It is demonstrated that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node.

Network flows - theory, algorithms and applications

In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.

Cascades in Networks and Aggregate Volatility

We provide a general framework for the study of cascade effects created by interconnections between sectors, firms or financial institutions. Focusing on a multi sector economy linked through a

Critical points and transitions in an electric power transmission model for cascading failure blackouts.

Cascading failure in a simplified transmission system model as load power demand is increased is examined and it is found that operation near critical points can produce power law tails in the blackout size probability distribution similar to those observed.

Contagion in financial networks

  • Prasanna GaiS. Kapadia
  • Economics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
This paper develops an analytical model of contagion in financial networks with arbitrary structure. We explore how the probability and potential impact of contagion is influenced by aggregate and

Monotone Dynamical Systems

1 Strongly Order-Preserving Semiflows 6 1.1 Definitions and Basic Results . . . . . . . . . . . . . . . . . . . . . . . . 6 1.2 Nonordering of Omega Limit Sets . . . . . . . . . . . . . . . . . . . .