HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Using Centrality Measures in Dependency Risk Graphs for Efficient Risk Mitigation

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01431008
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, January 10, 2017 - 2:56:10 PM
Last modification on : Friday, November 10, 2017 - 1:26:05 PM
Long-term archiving on: : Tuesday, April 11, 2017 - 3:10:15 PM

File

978-3-319-26567-4_18_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

George Stergiopoulos, Marianthi Theocharidou, Panayiotis Kotzanikolaou, Dimitris Gritzalis. Using Centrality Measures in Dependency Risk Graphs for Efficient Risk Mitigation. 9th International Conference on Critical Infrastructure Protection (ICCIP), Mar 2015, Arlington, VA, United States. pp.299-314, ⟨10.1007/978-3-319-26567-4_18⟩. ⟨hal-01431008⟩

Share

Metrics

Record views

44

Files downloads

216