Using centrality measures in dependency risk graphs for efficient risk mitigation

One way to model cascading critical infrastructure failures is through dependency risk graphs. These graphs help assess the expected risk of critical infrastructure dependency chains. This paper extends an existing dependency risk analysis methodology towards risk management. The relationship between dependency risk paths and graph centrality measures is explored in order to identify nodes that significantly impact the overall dependency risk. Experimental results using random graphs to simulate common critical infrastructure dependency characteristics are presented. Based on the experimental findings, an algorithm is proposed for efficient risk mitigation. The algorithm can be used to define priorities in selecting nodes for the application of mitigation controls.

STERGIOPOULOS George;  THEOCHARIDOU Marianthi;  KOTZANIKOLAOU Panayiotis;  GRITZALIS Dimitris; 

2015-12-14

Springer International Publishing

JRC94443

978-3-319-26566-7,    978-3-319-26567-4,   

1868-4238,   

http://link.springer.com/chapter/10.1007/978-3-319-26567-4_18,    https://publications.jrc.ec.europa.eu/repository/handle/JRC94443,   

10.1007/978-3-319-26567-4_18,