On Robustness in Multilayer Interdependent Network

by   Joydeep Banerjee, et al.

Critical Infrastructures like power and communication networks are highly interdependent on each other for their full functionality. Many significant research have been pursued to model the interdependency and failure analysis of these interdependent networks. However, most of these models fail to capture the complex interdependencies that might actually exist between the infrastructures. The Implicative Interdependency Model that utilizes Boolean Logic to capture complex interdependencies was recently proposed which overcome the limitations of the existing models. A number of problems were studies based on this model. In this paper we study the Robustness problem in Interdependent Power and Communication Network. The robustness is defined with respect to two parameters K ∈ I^+∪{0} and ρ∈ (0,1]. We utilized the Implicative Interdependency Model model to capture the complex interdependency between the two networks. The model classifies the interdependency relations into four cases. Computational complexity of the problem is analyzed for each of these cases. A polynomial time algorithm is designed for the first case that outputs the optimal solution. All the other cases are proved to be NP-complete. An in-approximability bound is provided for the third case. For the general case we formulate an Integer Linear Program to get the optimal solution and a polynomial time heuristic. The applicability of the heuristic is evaluated using power and communication network data of Maricopa County, Arizona. The experimental results showed that the heuristic almost always produced near optimal value of parameter K for ρ < 0.42.


page 1

page 2

page 3

page 4


The airplane refueling problem is NP-complete and is solvable in polynomial time

The airplane refueling problem is a nonlinear combinatorial optimization...

Analysis of Temporal Robustness in Massive Machine Type Communications

The evolution of fifth generation (5G) networks needs to support the lat...

Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks

Radio frequency (RF) energy harvesting is key in attaining perpetual lif...

The College Application Problem

This paper considers the maximization of the expected maximum value of a...

In Search of Dense Subgraphs: How Good is Greedy Peeling?

The problem of finding the densest subgraph in a given graph has several...

Computational Aspects of Optimal Strategic Network Diffusion

The diffusion of information has been widely modeled as stochastic diffu...

Identification of the K-most Vulnerable Entities in a Smart Grid System

A smart grid system can be considered as a multi-layered network with po...

Please sign up or login with your details

Forgot password? Click here to reset