UNIV. NEWS. NORTH-CAUCAS. REG. TECHNICAL SCIENCES SERIES. 2016; 1: 47-51
http://dx.doi.org/10.17213/0321-2653-2016-1-47-51
COMPARISON OF ALGORITHMS USED TO SOLVE OPTIMIZATION PROBLEMS IN DISTRIBUTED SYSTEMS OF INFORMATION PROTECTION
Katsupeev Andrey Aleksandrovich – post-graduate student, Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: andreykatsupeev@gmail.com
Shcherbakova Elena Aleksandrovna – Candidate of Economic Science, assistant professor, Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: luxii@inbox.ru
Vorobyev Sergey Petrovich – Candidate of Technical Sciences, Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: vsp1999@yandex.ru
Litvyak Roman Konstantinovich – Senior Lecturer, Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: litvyak_rk@rambler.ru
Abstract
The article discusses algorithms for choosing the optimal model of information security strategy in distributed systesm taking into account the equivalence of protection. The analysis of these algorithms for solving model have been provided: a greedy algorithm, simulated annealing algorithm, genetic algorithm Holland and a number of its modifications, including changing crossover operator, mutation and directly stroke of algorithm. In particular, the algorithms with fixed and variable mutation, with relative fitness function were discussed. A comparison of these algorithms for finding the optimal decision criteria and time-consuming were provided.
Keywords: information security; distributed systems; genetic algorithm; greedy algorithm; simulated annealing algorithm; fitness function.
Full text: [in elibrary.ru]
References
1. Katsupeev A.A., Shcherbakova E.A., Vorob'ev S.P. Postanovka i formalizatsiya zadachi formirovaniya informatsionnoi zashchity raspredelennykh sistem [Statement and formalization of a problem of formation of information protection of the distributed systems]. Inzhenernyi vestnik Dona, 2015, no. 1-2.
2. Pisinger D. Knapsack problems. Copenhagen, 1995. 199 р.
3. Kormen T., Leizerson Ch., Rivest R., Shtain K. Algoritmy: postroenie i analiz [Algorithms: construction and analysis]. Moscow, 2005, 1296 p.
4. Levitin A.V. Algoritmy. Vvedenie v razrabotku i analiz [Algorithms. Introduction to development and analysis]. Moscow, 2006. 576 p.
5. Kallan R. Osnovnye kontseptsii neironnykh setei [Main concepts of neural networks]. Moscow, 2003, 288 p.
6. Dzhons M.T. Programmirovanie iskusstvennogo intellekta v prilozheniyakh [Programming of artificial intelligence in appendices]. Moscow, 2004, 312p.
7. Gladkov L.A., Kureichik V.M., Kureichik V.V. Geneticheskie algoritmy [Genetic algorithms]. Rostov-on-Don, 2004, 400 p.
8. Skobtsov Yu.A. Osnovy evolyutsionnykh vychislenii [Bases of evolutionary calculations]. Donetsk, 2008, 452 p.
9. Katsupeev A.A. Primenenie geneticheskogo algoritma k resheniyu zadachi formirovaniya informatsionnoi zashchity raspredelennykh system [Application of genetic algorithm to the solution of a problem of formation of information protection of the distributed systems]. Teoriya, metody proektirovaniya, programmno-tekhnicheskaya platforma korporativnykh informatsionnykh system, 2015.
10. Katsupeev A.A. Opisanie programmnogo produkta, realizuyushchego geneticheskii algoritm formirovaniya informatsionnoi zashchity raspredelennykh sistem [The description of the software product realizing genetic algorithm of formation of information protection of the distributed systems]. Teoriya, metody proektirovaniya, programmno-tekhnicheskaya platforma korporativnykh informatsionnykh system, 2015.