Connectivity in Interdependent Networks
Author(s)Zhang, Jianan; Modiano, Eytan H.
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
IEEE/ACM Transactions on Networking
Institute of Electrical and Electronics Engineers (IEEE)
Zhang, Jianan and Modiano, Eytan. "Connectivity in Interdependent Networks." IEEE/ACM Transactions on Networking 26, 5 (October 2018): 2090 - 2103 © 1993-2012 IEEE.
Author's final manuscript