Skip to main content
SpringerLink
Log in

A Model of Optimal Complexification of Measures Providing Information Security

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

An optimization mathematical model and an algorithm of complexification of the measures providing information security are presented. As an indicator of complexification efficiency, the level of the costs of execution of the tasks of providing the information security of a protected object is used. Thus, the costs of the elaboration (preparation) of these measures and their implementation costs for the information security system are considered separately. The optimization algorithm is based on the common principles of the branch and bound method. Its feature is the proposed algorithm for estimating the bounds for alternative branches. The model has a universal character and may be used when developing the algorithms for supporting the corresponding management decisions concerning information security for concrete information infrastructures of managerial-technical, social, economic, and other objects.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Anisimov, V.G., Anisimov, E.G., Zegzhda, P.D., and Suprun, A.F., The problem of innovative development of information security systems in the transport sector, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 1105–1110.

    Article  Google Scholar 

  2. Zegzhda, D.P. and Pavlenko, E.Yu., Digital manufacturing security indicators, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 1150–1159. https://doi.org/10.3103/S0146411618080333

    Article  Google Scholar 

  3. Lavrova, D.S., Alekseev, I.V., and Shtyrkina, A.A., Security analysis based on controlling dependences of network traffic parameters by wavelet transformation, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 931–935.

    Article  Google Scholar 

  4. Anisimov, V.G., Zegzhda, P.D., Anisimov, E.G., and Bazhin, D.A., A risk-oriented approach to the control arrangement of security protection subsystems of information systems, Autom. Control Comput. Sci., 2016, vol. 50, no. 8, pp. 717–721.

    Article  Google Scholar 

  5. Kalinin, M.O., Zubkov, E.A., Suprun, A.F., and Pechenkin, A.I., Prevention of attacks on dynamic routing in self-organizing adhoc networks using swarm intelligence, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 977–983.

    Article  Google Scholar 

  6. Anisimov, V.G., Anisimov, E.G., Saurenko, T.N., and Zotova, E.A., Models of forecasting destructive influence risks for information processes in management systems, Inf.-Upr. Sist., 2019, no. 5, pp. 18–23.

  7. Pavlenko, E.Yu., Yarmak, A.V., and Moskvin, D.A., Hierarchical approach to analyzing security breaches in information systems, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 829–834.

    Article  Google Scholar 

  8. Saurenko, T., et al., Justification of financing of measures to prevent accidents in power systems, Adv. Intell. Syst. Comput., 2019, vol. 983, pp. 295–305.

    Google Scholar 

  9. Kalinin, M.O. and Minin, A.A., Security evaluation of a wireless ad-hoc network with dynamic topology, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 899–901.

    Article  Google Scholar 

  10. Anisimov, V.G., Anisimov, E.G., Zegzhda, P.D., Saurenko, T.N., and Prisyazhnyuk, S.P., Indices of the effectiveness of information protection in an information interaction system for controlling complex distributed organizational objects, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 824–828.

    Article  Google Scholar 

  11. Lavrova, D., Zaitceva, E., and Zegzhda, P., Bio-inspired approach to self-regulation for industrial dynamic network infrastructure, CEUR Workshop Proc., 2019, vol. 2603, pp. 34–39.

    Google Scholar 

  12. Gapov, M.R., et al., Strategicheskoe upravlenie innovatsionnoi deyatel’nost’yu: Analiz, planirovanie, modelirovanie, prinyatiya reshenii, organizatsiya, otsenka (Strategic Innovation Management: Analysis, Planning, Modeling, Decision-Making, Organization, and Assessment), St. Petersburg, 2017.

  13. Anisimov, E.G., Anisimov, V.G., and Sonkin, M.A., Mathematical simulation of adaptive allocation of discrete resources, Proceedings of the 2016 Conference on Information Technologies in Science, Management, Social Sphere and Medicine (ITSMSSM 2016), Tomsk, 2016, pp. 282–285.

  14. Novikov, V.E., et al., Modeling of optimization problems of decision support in innovation management, Vestn. Ross. Tamozhen. Akad., 2016, no. 1, pp. 90–98.

  15. Anisimov, V., Anisimov, E., and Sonkin, M., A resource-and-time method to optimize the performance of several interrelated operations, Int. J. Appl. Eng. Res., 2015, vol. 10, no. 17, pp. 38127–38132.

    Google Scholar 

  16. Anisimov, V.G., et al., Model and method for optimizing computational processes in parallel computing systems, Autom. Control Comput. Sci., 2019, vol. 53, no. 8, pp. 1–7.

    Article  Google Scholar 

  17. Alekseev, O.G., Modeli raspredeleniya sredstv porazheniya v dinamike boya (Models for Distribution of Weapons of Destruction in the Dynamics of Battle), Leningrad: Minist. Oborony SSSR, 1989.

  18. Anisimov, V.G. and Anisimov, E.G., An optimization model for distribution of renewable resources in the management of economic systems, Vestn. Ross. Tamozhen. Akad., 2007, no. 1, pp. 49–54.

  19. Il’in, I.V., et al., Matematicheskie metody i instrumental’nye sredstva otsenivaniya effektivnosti investitsii v innovatsionnye proekty (Mathematical Methods and Tools for Evaluating the Effeciency of Investments in Innovative Projects), St. Petersburg, 2018.

    Google Scholar 

  20. Yachkula, N.I., et al., Application of Markov chains to the evaluation of the computational complexity of the simplex method, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1988, no. 3, pp. 59–63.

  21. Anisimov, V.G. and Anisimov, E.G., A branch-and-bound algorithm for one class of scheduling problem, Comput. Math. Math. Phys., 1992, vol. 32, no. 12, pp. 1827–1832.

    MathSciNet  MATH  Google Scholar 

  22. Alekseev, A.O., Alekseev, O.G., Anisimov, V.G., and Anisimov, E.G., The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem, Comput. Math. Math. Phys., 1985, vol. 25, no. 6, pp. 50–54.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, 195251, St. Petersburg, Russia

    P. D. Zegzhda, V. G. Anisimov & A. F. Suprun

  2. Peoples’ Friendship University of Russia, 117198, Moscow, Russia

    E. G. Anisimov & T. N. Saurenko

  3. Russian Technological University MIREA, 119454, Moscow, Russia

    V. P. Los’

Authors
  1. P. D. Zegzhda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. G. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. F. Suprun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E. G. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. T. N. Saurenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. V. P. Los’
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to P. D. Zegzhda or V. G. Anisimov.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by E. Smirnova

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zegzhda, P.D., Anisimov, V.G., Suprun, A.F. et al. A Model of Optimal Complexification of Measures Providing Information Security. Aut. Control Comp. Sci. 54, 930–936 (2020). https://doi.org/10.3103/S0146411620080374

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411620080374

Keywords:

Search

Navigation