
Vulnerability Analysis of Complex Network Infrastructures Using a Genetic Algorithm
Grebenyuk, G.G., Nikishov, S.M., and Sereda, L.A. Vulnerability Analysis of Complex Network Infrastructures Using a Genetic Algorithm
Abstract. This paper proposes a method for analyzing the vulnerability of network infrastructures. The method uses a genetic algorithm for finding crosssections that block delivering resources from their sources to consumers. The wellknown approaches to solving network problems based on combinatorial and evolutionary approaches are considered. A feature of the proposed method is the fitness function chosen as an algorithm for calculating the number of paths in the graph when isolating the graph vertices that make up the individual. The graph reachability matrix and simple mathematical operations are adopted to optimize the fitness function and calculate the number of paths. The efficiency of the genetic algorithm compared to combinatorial methods is shown: multiple failures are found significantly faster than using exhaustive search algorithms.
Keywords: safety, engineering networks, vulnerability, reliability, combinatorial algorithms, models for damage analysis, crucial elements of an engineering network, genetic algorithms.
PDF (English)
Cite this article
Grebenyuk, G.G., Nikishov, S.M., Sereda, L.A. Vulnerability Analysis of Complex Network Infrastructures Using a Genetic Algorithm, Control Sciences 6, 44–50 (2021). http://doi.org/10.25728/cs.2021.6.5
PDF (Russian)
