Analysing robustness in intra-dependent and inter-dependent networks using a new model of interdependency

Joydeep Banerjee, Kaustav Basu, Arunabha Sen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Power and communication network of a nation are heavily interdependent on each other. Dependencies exist between the individual networks, for example, the power network, as well. Failure of certain entities results in cascading failure leading to widespread power blackouts. Hence it is critical to understand and model such dependencies. In previous literature, authors have proposed different models to describe these dependencies. However, these models are limited to capture the complex dependencies that might exist in a critical infrastructure. In this paper, firstly we present a Boolean logic based model called the implicative interdependency model, which overcomes the major shortcomings of the previous models. Using the model a metric to compute robustness of these systems is defined. The computational complexity to compute this metric is proved to be NP-complete. An optimal integer linear program and a sub-optimal heuristic with polynomial time complexity are provided that solves the robustness computation problem. Using real world data of interdependent power-communication network and data of different bus systems for power network the efficacy of the heuristic is compared to the optimal solution.

Original languageEnglish (US)
Pages (from-to)156-181
Number of pages26
JournalInternational Journal of Critical Infrastructures
Volume14
Issue number2
DOIs
StatePublished - Jan 1 2018

Fingerprint

communication network
heuristics
Telecommunication networks
Critical infrastructures
Computational complexity
infrastructure
Polynomials
bus
programme

Keywords

  • Communication network
  • Dependency
  • Interdependency
  • Power network
  • Robustness

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Environmental Science(all)
  • Energy(all)

Cite this

Analysing robustness in intra-dependent and inter-dependent networks using a new model of interdependency. / Banerjee, Joydeep; Basu, Kaustav; Sen, Arunabha.

In: International Journal of Critical Infrastructures, Vol. 14, No. 2, 01.01.2018, p. 156-181.

Research output: Contribution to journalArticle

@article{789aca55528a4e6cbcf318094daf483d,
title = "Analysing robustness in intra-dependent and inter-dependent networks using a new model of interdependency",
abstract = "Power and communication network of a nation are heavily interdependent on each other. Dependencies exist between the individual networks, for example, the power network, as well. Failure of certain entities results in cascading failure leading to widespread power blackouts. Hence it is critical to understand and model such dependencies. In previous literature, authors have proposed different models to describe these dependencies. However, these models are limited to capture the complex dependencies that might exist in a critical infrastructure. In this paper, firstly we present a Boolean logic based model called the implicative interdependency model, which overcomes the major shortcomings of the previous models. Using the model a metric to compute robustness of these systems is defined. The computational complexity to compute this metric is proved to be NP-complete. An optimal integer linear program and a sub-optimal heuristic with polynomial time complexity are provided that solves the robustness computation problem. Using real world data of interdependent power-communication network and data of different bus systems for power network the efficacy of the heuristic is compared to the optimal solution.",
keywords = "Communication network, Dependency, Interdependency, Power network, Robustness",
author = "Joydeep Banerjee and Kaustav Basu and Arunabha Sen",
year = "2018",
month = "1",
day = "1",
doi = "10.1504/IJCIS.2018.091938",
language = "English (US)",
volume = "14",
pages = "156--181",
journal = "International Journal of Critical Infrastructures",
issn = "1475-3219",
publisher = "Inderscience Enterprises Ltd",
number = "2",

}

TY - JOUR

T1 - Analysing robustness in intra-dependent and inter-dependent networks using a new model of interdependency

AU - Banerjee, Joydeep

AU - Basu, Kaustav

AU - Sen, Arunabha

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Power and communication network of a nation are heavily interdependent on each other. Dependencies exist between the individual networks, for example, the power network, as well. Failure of certain entities results in cascading failure leading to widespread power blackouts. Hence it is critical to understand and model such dependencies. In previous literature, authors have proposed different models to describe these dependencies. However, these models are limited to capture the complex dependencies that might exist in a critical infrastructure. In this paper, firstly we present a Boolean logic based model called the implicative interdependency model, which overcomes the major shortcomings of the previous models. Using the model a metric to compute robustness of these systems is defined. The computational complexity to compute this metric is proved to be NP-complete. An optimal integer linear program and a sub-optimal heuristic with polynomial time complexity are provided that solves the robustness computation problem. Using real world data of interdependent power-communication network and data of different bus systems for power network the efficacy of the heuristic is compared to the optimal solution.

AB - Power and communication network of a nation are heavily interdependent on each other. Dependencies exist between the individual networks, for example, the power network, as well. Failure of certain entities results in cascading failure leading to widespread power blackouts. Hence it is critical to understand and model such dependencies. In previous literature, authors have proposed different models to describe these dependencies. However, these models are limited to capture the complex dependencies that might exist in a critical infrastructure. In this paper, firstly we present a Boolean logic based model called the implicative interdependency model, which overcomes the major shortcomings of the previous models. Using the model a metric to compute robustness of these systems is defined. The computational complexity to compute this metric is proved to be NP-complete. An optimal integer linear program and a sub-optimal heuristic with polynomial time complexity are provided that solves the robustness computation problem. Using real world data of interdependent power-communication network and data of different bus systems for power network the efficacy of the heuristic is compared to the optimal solution.

KW - Communication network

KW - Dependency

KW - Interdependency

KW - Power network

KW - Robustness

UR - http://www.scopus.com/inward/record.url?scp=85047610719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047610719&partnerID=8YFLogxK

U2 - 10.1504/IJCIS.2018.091938

DO - 10.1504/IJCIS.2018.091938

M3 - Article

VL - 14

SP - 156

EP - 181

JO - International Journal of Critical Infrastructures

JF - International Journal of Critical Infrastructures

SN - 1475-3219

IS - 2

ER -