TY - GEN
T1 - Identification of K most vulnerable nodes in multi-layered network using a new model of interdependency
AU - Sen, Arunabha
AU - Mazumder, Anisha
AU - Banerjee, Joydeep
AU - Das, Arun
AU - Compton, Randy
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2014
Y1 - 2014
N2 - The critical infrastructures of a nation including the power grid and the communication network are highly interdependent. Recognizing the need for a deeper understanding of the interdependency in a multi-layered network, significant efforts have been made by the research community in the last few years to achieve this goal. Accordingly a number of models have been proposed and analyzed. Unfortunately, most of the models are over simplified and, as such, they fail to capture the complex interdependency that exists between entities of the power grid and the communication networks involving a combination of conjunctive and disjunctive relations. To overcome the limitations of existing models, we propose a new model that is able to capture such complex interdependency relations. Utilizing this model, we provide techniques to identify the K most 'vulnerable' nodes of an interdependent network. We show that the problem can be solved in polynomial time in some special cases, whereas for some others, the problem is NP-complete. We establish that this problem is equivalent to computation of a fixed point of a multilayered network system and we provide a technique for its computation utilizing Integer Linear Programming. Finally, we evaluate the efficacy of our technique using real data collected from the power grid and the communication network that span the Maricopa County of Arizona.
AB - The critical infrastructures of a nation including the power grid and the communication network are highly interdependent. Recognizing the need for a deeper understanding of the interdependency in a multi-layered network, significant efforts have been made by the research community in the last few years to achieve this goal. Accordingly a number of models have been proposed and analyzed. Unfortunately, most of the models are over simplified and, as such, they fail to capture the complex interdependency that exists between entities of the power grid and the communication networks involving a combination of conjunctive and disjunctive relations. To overcome the limitations of existing models, we propose a new model that is able to capture such complex interdependency relations. Utilizing this model, we provide techniques to identify the K most 'vulnerable' nodes of an interdependent network. We show that the problem can be solved in polynomial time in some special cases, whereas for some others, the problem is NP-complete. We establish that this problem is equivalent to computation of a fixed point of a multilayered network system and we provide a technique for its computation utilizing Integer Linear Programming. Finally, we evaluate the efficacy of our technique using real data collected from the power grid and the communication network that span the Maricopa County of Arizona.
UR - http://www.scopus.com/inward/record.url?scp=84904488825&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904488825&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2014.6849338
DO - 10.1109/INFCOMW.2014.6849338
M3 - Conference contribution
AN - SCOPUS:84904488825
SN - 9781479930883
T3 - Proceedings - IEEE INFOCOM
SP - 831
EP - 836
BT - 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014
Y2 - 27 April 2014 through 2 May 2014
ER -