Robust routing in interdependent networks
We consider a model of two interdependent networks, where every node in one network depends on one or more supply nodes in the other network and a node fails if it loses all of its supply nodes. We develop algorithms to compute the failure probability of a path, and obtain the most reliable path bet...
Main Authors: | Zhang, Jianan, Modiano, Eytan H |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
Online Access: | http://hdl.handle.net/1721.1/114606 https://orcid.org/0000-0003-3318-2165 https://orcid.org/0000-0001-8238-8130 |
Similar Items
-
Robustness of Interdependent Random Geometric Networks
by: Zhang, Jianan, et al.
Published: (2020) -
Robustness of interdependent random geometric networks
by: Yeh, Edmund, et al.
Published: (2017) -
Connectivity in Interdependent Networks
by: Zhang, Jianan, et al.
Published: (2020) -
Robustness of interdependent geometric networks under inhomogeneous failures
by: Kamran, Khashayar, et al.
Published: (2020) -
Robustness of interdependent networks: The case of communication networks and the power grid
by: Parandehgheibi, Marzieh, et al.
Published: (2015)