Abstract
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 research 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.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Stergiopoulos, G., Theocharidou, M., Kotzanikolaou, P., Gritzalis, D. (2015). Using Centrality Measures in Dependency Risk Graphs for Efficient Risk Mitigation. In: Rice, M., Shenoi, S. (eds) Critical Infrastructure Protection IX. ICCIP 2015. IFIP Advances in Information and Communication Technology, vol 466. Springer, Cham. https://doi.org/10.1007/978-3-319-26567-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-26567-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26566-7
Online ISBN: 978-3-319-26567-4
eBook Packages: Computer ScienceComputer Science (R0)