On the Entity Hardening Problem in multi-layered interdependent networks

Joydeep Banerjee, Arun Das, Chenyang Zhou, Anisha Mazumder, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

The power grid and the communication network are highly interdependent on each other for their well being. In recent times the research community has shown significant interest in modeling such interdependent networks and studying the impact of failures on these networks. Although a number of models have been proposed, many of them are simplistic in nature and fail to capture the complex interdependencies that exist between the entities of these networks. To overcome the limitations, recently an Implicative Interdependency Model that utilizes Boolean Logic, was proposed and a number of problems were studied. In this paper we study the 'entity hardening' problem, where by 'entity hardening' we imply the ability of the network operator to ensure that an adversary (be it Nature or human) cannot take a network entity from operative to inoperative state. Given that the network operator with a limited budget can only harden k entities, the goal of the entity hardening problem is to identify the set of k entities whose hardening will ensure maximum benefit for the operator, i.e. maximally reduce the ability of the adversary to degrade the network. We classify the problem into four cases and show that the problem is solvable in polynomial time for the first case, whereas for others it is NP-complete. We provide an inapproximability result for the second case, an approximation algorithm for the third case, and a heuristic for the fourth (general) case. We evaluate the efficacy of our heuristic using power and communication network data of Maricopa County, Arizona. The experiments show that our heuristic almost always produces near optimal results.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages648-653
Number of pages6
Volume2015-August
ISBN (Print)9781467371315
DOIs
StatePublished - Aug 4 2015
EventIEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2015 - Hong Kong, Hong Kong
Duration: Apr 26 2015May 1 2015

Other

OtherIEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2015
CountryHong Kong
CityHong Kong
Period4/26/155/1/15

Fingerprint

Hardening
Telecommunication networks
Approximation algorithms
Polynomials
Experiments

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Banerjee, J., Das, A., Zhou, C., Mazumder, A., & Sen, A. (2015). On the Entity Hardening Problem in multi-layered interdependent networks. In Proceedings - IEEE INFOCOM (Vol. 2015-August, pp. 648-653). [7179459] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFCOMW.2015.7179459

On the Entity Hardening Problem in multi-layered interdependent networks. / Banerjee, Joydeep; Das, Arun; Zhou, Chenyang; Mazumder, Anisha; Sen, Arunabha.

Proceedings - IEEE INFOCOM. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. p. 648-653 7179459.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Banerjee, J, Das, A, Zhou, C, Mazumder, A & Sen, A 2015, On the Entity Hardening Problem in multi-layered interdependent networks. in Proceedings - IEEE INFOCOM. vol. 2015-August, 7179459, Institute of Electrical and Electronics Engineers Inc., pp. 648-653, IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2015, Hong Kong, Hong Kong, 4/26/15. https://doi.org/10.1109/INFCOMW.2015.7179459
Banerjee J, Das A, Zhou C, Mazumder A, Sen A. On the Entity Hardening Problem in multi-layered interdependent networks. In Proceedings - IEEE INFOCOM. Vol. 2015-August. Institute of Electrical and Electronics Engineers Inc. 2015. p. 648-653. 7179459 https://doi.org/10.1109/INFCOMW.2015.7179459
Banerjee, Joydeep ; Das, Arun ; Zhou, Chenyang ; Mazumder, Anisha ; Sen, Arunabha. / On the Entity Hardening Problem in multi-layered interdependent networks. Proceedings - IEEE INFOCOM. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. pp. 648-653
@inproceedings{4dcc664e32534afb9f7fa59202b72d00,
title = "On the Entity Hardening Problem in multi-layered interdependent networks",
abstract = "The power grid and the communication network are highly interdependent on each other for their well being. In recent times the research community has shown significant interest in modeling such interdependent networks and studying the impact of failures on these networks. Although a number of models have been proposed, many of them are simplistic in nature and fail to capture the complex interdependencies that exist between the entities of these networks. To overcome the limitations, recently an Implicative Interdependency Model that utilizes Boolean Logic, was proposed and a number of problems were studied. In this paper we study the 'entity hardening' problem, where by 'entity hardening' we imply the ability of the network operator to ensure that an adversary (be it Nature or human) cannot take a network entity from operative to inoperative state. Given that the network operator with a limited budget can only harden k entities, the goal of the entity hardening problem is to identify the set of k entities whose hardening will ensure maximum benefit for the operator, i.e. maximally reduce the ability of the adversary to degrade the network. We classify the problem into four cases and show that the problem is solvable in polynomial time for the first case, whereas for others it is NP-complete. We provide an inapproximability result for the second case, an approximation algorithm for the third case, and a heuristic for the fourth (general) case. We evaluate the efficacy of our heuristic using power and communication network data of Maricopa County, Arizona. The experiments show that our heuristic almost always produces near optimal results.",
author = "Joydeep Banerjee and Arun Das and Chenyang Zhou and Anisha Mazumder and Arunabha Sen",
year = "2015",
month = "8",
day = "4",
doi = "10.1109/INFCOMW.2015.7179459",
language = "English (US)",
isbn = "9781467371315",
volume = "2015-August",
pages = "648--653",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - On the Entity Hardening Problem in multi-layered interdependent networks

AU - Banerjee, Joydeep

AU - Das, Arun

AU - Zhou, Chenyang

AU - Mazumder, Anisha

AU - Sen, Arunabha

PY - 2015/8/4

Y1 - 2015/8/4

N2 - The power grid and the communication network are highly interdependent on each other for their well being. In recent times the research community has shown significant interest in modeling such interdependent networks and studying the impact of failures on these networks. Although a number of models have been proposed, many of them are simplistic in nature and fail to capture the complex interdependencies that exist between the entities of these networks. To overcome the limitations, recently an Implicative Interdependency Model that utilizes Boolean Logic, was proposed and a number of problems were studied. In this paper we study the 'entity hardening' problem, where by 'entity hardening' we imply the ability of the network operator to ensure that an adversary (be it Nature or human) cannot take a network entity from operative to inoperative state. Given that the network operator with a limited budget can only harden k entities, the goal of the entity hardening problem is to identify the set of k entities whose hardening will ensure maximum benefit for the operator, i.e. maximally reduce the ability of the adversary to degrade the network. We classify the problem into four cases and show that the problem is solvable in polynomial time for the first case, whereas for others it is NP-complete. We provide an inapproximability result for the second case, an approximation algorithm for the third case, and a heuristic for the fourth (general) case. We evaluate the efficacy of our heuristic using power and communication network data of Maricopa County, Arizona. The experiments show that our heuristic almost always produces near optimal results.

AB - The power grid and the communication network are highly interdependent on each other for their well being. In recent times the research community has shown significant interest in modeling such interdependent networks and studying the impact of failures on these networks. Although a number of models have been proposed, many of them are simplistic in nature and fail to capture the complex interdependencies that exist between the entities of these networks. To overcome the limitations, recently an Implicative Interdependency Model that utilizes Boolean Logic, was proposed and a number of problems were studied. In this paper we study the 'entity hardening' problem, where by 'entity hardening' we imply the ability of the network operator to ensure that an adversary (be it Nature or human) cannot take a network entity from operative to inoperative state. Given that the network operator with a limited budget can only harden k entities, the goal of the entity hardening problem is to identify the set of k entities whose hardening will ensure maximum benefit for the operator, i.e. maximally reduce the ability of the adversary to degrade the network. We classify the problem into four cases and show that the problem is solvable in polynomial time for the first case, whereas for others it is NP-complete. We provide an inapproximability result for the second case, an approximation algorithm for the third case, and a heuristic for the fourth (general) case. We evaluate the efficacy of our heuristic using power and communication network data of Maricopa County, Arizona. The experiments show that our heuristic almost always produces near optimal results.

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

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

U2 - 10.1109/INFCOMW.2015.7179459

DO - 10.1109/INFCOMW.2015.7179459

M3 - Conference contribution

AN - SCOPUS:84943251411

SN - 9781467371315

VL - 2015-August

SP - 648

EP - 653

BT - Proceedings - IEEE INFOCOM

PB - Institute of Electrical and Electronics Engineers Inc.

ER -