Robust routing in interdependent networks
Name
routing.pdf
Size
221.74 KB
Format
Adobe PDF
Checksum (MD5)
aeb0e476cb48afef0d5f63c60a0ab708
Author(s)
Zhang, Jianan
Modiano, Eytan H
Date Issued
October 2017
Journal
IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhang, Jianan, and Eytan Modiano. “Robust Routing in Interdependent Networks.” IEEE INFOCOM 2017 - IEEE Conference on Computer Communications (May 2017).
Version
Author's final manuscript
Abstract
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 between a pair of nodes in a network, under the condition that each supply node fails independently with a given probability. Our work generalizes the classical shared risk group model, by considering multiple risks associated with a node and letting a node fail if all the risks occur. Moreover, we study the diverse routing problem by considering two paths between a pair of nodes. We define two paths to be d-failure resilient if at least one path survives after removing d or fewer supply nodes, which generalizes the concept of disjoint paths in a single network, and risk-disjoint paths in a classical shared risk group model. We compute the probability that both paths fail, and develop algorithms to compute the most reliable pair of paths.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFOCOM.2017.8057224
