Connectivity in Interdependent Networks
Name
1709.03034.pdf
Description
Accepted version
Size
418.67 KB
Format
Adobe PDF
Checksum (MD5)
4f4bf532eb3702fc31f5adc3d2d42a10
Author(s)
Zhang, Jianan
Modiano, Eytan H.
Date Issued
September 2018
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhang, Jianan and Modiano, Eytan. "Connectivity in Interdependent Networks." IEEE/ACM Transactions on Networking 26, 5 (October 2018): 2090 - 2103 © 1993-2012 IEEE.
Version
Author's final manuscript
Abstract
We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the other graph, and a node fails if all of its supply nodes fail. Such interdependence arises in cyber-physical systems and layered network architectures. We study the supply node connectivity of a network: namely, the minimum number of supply node removals that would disconnect the network. We develop algorithms to evaluate the supply node connectivity given arbitrary network topologies and interdependence between two networks. Moreover, we develop interdependence assignment algorithms that maximize the supply node connectivity. We prove that a random assignment algorithm yields a supply node connectivity within a constant factor from the optimal for most networks. Keywords: Robustness; cyber-physical systems; communication networks; analytical models.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
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/tnet.2018.2863715
