Modelling critical infrastructures in presence of lack of data with simulated annealing - Like algorithms

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a method to analyze inter-dependencies of technological networks and infrastructures when dealing with few available data or missing data. We suggest a simple inclusive index for inter-dependencies and note that even introducing broad simplifications, it is not possible to provide enough information to whatever analysis framework. Hence we resort to a Simulated Annealing-like algorithm (SAFE) to calculate the most probable cascading failure scenarios following a given unfavourable event in the network, compatibly with the previously known data. SAFE gives an exact definition of the otherwise vague notion of criticality and individuates the "critical" links/nodes. Moreover, a uniform probability distribution is used to approximate the unknown or missing data in order to cope with the recent finding that Critical Infrastructures such as the power system exhibit the self-organizing criticality phenomenon. A toy example based on a real topology is given; SAFE proves to be a reasonably fast, accurate and computationally simple evaluation tool in presence of more than 50% missing data. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fioriti, V., Ruzzante, S., Castorini, E., Di Pietro, A., & Tofani, A. (2009). Modelling critical infrastructures in presence of lack of data with simulated annealing - Like algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5775 LNCS, pp. 81–88). https://doi.org/10.1007/978-3-642-04468-7_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free