AN OPTIMIZATION OF STRUCTURES AND TRAFFIC DEVELOPMENT FOR TRANSMISSION OF INFORMATION IN PROTECTED CORPORATE NETWORKS. A QUANTITATIVE OPTIMIZATION
DOI:
https://doi.org/10.28925/2663-4023.2020.7.103114Keywords:
information system; optimization; informational security; quantitative criterion; resource; complex information security systemAbstract
The article is devoted to the optimization of the structures and traffic development for information transmission in secured corporate networks by quantitative factor. Optimization is carried out in the local task of calculating rational amounts of information. To this end, a mathematical formulation of a local problem is formulated. Which is to optimize the resources of the information system by quantitative criteria. The task is solved by calculating rational amounts of information and entering them in the description of information system resources.
It is necessary to evaluate the quality of networks that are being designed based on multicriteria optimization. This is due to the increase in volume and the variety of tasks being promoted to secured corporate networks. This optimization should take into account the full range of recent developments in the field of systematic approach, modern scalarisation principles, decomposition and aggregation techniques, graph theory, optimization algorithms, hierarchical synthesis structuring methods with consistent decision making.
The task begins with the construction of information structures, which are linked oriented graphs. The vertices of the graphs are macro-level interaction tasks that carry out information exchange between local area network elements and local area networks, while arcs are information influences or messages. The structures for the micro level are accordingly constructed.
Macro-level and micro-level interaction tasks are divided into three types: source resources; transit resources; user resources.
The optimization of structures by quantitative factor is carried out in the local task of calculating rational amounts of information. The amount of information means the number of elementary characters. It should be noted that these are volumes of information that consist of basic rather than synthetic indicators. A reasonable amount of information must comply with the completeness of the information which are put forward by consumers task.
If the amount of information is less than required, then the network element, the consumer, or the entire network will experience a lack of information. If the required volume is exceeded, there is an unproductive cost of generating, processing and transmitting information or the results of the tasks, as well as threats to the availability of the system. In the global case, the problem is much more complicated because part of the information flow can be an information destructive influence or a threat of breach of information security criteria.
Downloads
References
L. Ford and D. Fulkerson, Flows in Networks. Princeton University Press, 1962, p. 216. (in English).
R. Karp, “Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations”, New York and London, 1972, pp. 85–103. (in English).
R. Karp, “A simple derivation of Edmonds’ algorithm for optimum branching”, Network, no. 3, pp. 265 – 272, 1971. (in English).
Je. Majnika, Optimization Algorithms on Networks and Graphs. М.: Mir, 1981, p. 324. (in Russian).
V. I. Romanovskyi, M. V. Kachan , “Assessment of the efficiency of electric energy transmission in SIP lines of distribution electric networks”, Vostochno-Evropejskij zhurnal peredovyh tehnologij, №4(8), pp. 29-33, 2014. (in Ukrainian).
I.V. Romanovskij, Algorithms for solving extreme problems. M.: Nauka, p. 284, 1987. (in Russian).
O.P. Martynova, A.A. Zasiadko, V.L. Baranov, “Improvement of information security of computer networks by methods of multicriteria and multipath routing”, Information processing systems, № 7(81), pp. 29-32, 2209. (in Russian).
V.D. Lande, Fundamentals of the integration of information flows: Monograph. K.: Inzhiniring, 2006, p. 240. (in Russian).
D. V. Lande, S. V. Pryshchepa, T. V. Sinkova, “Automatic construction of terminology network as a domain model”, Reiestratsiia, zberihannia i obrobka danykh, № 3(17), pp. 22 – 29, 2015. (in Ukrainian).
V.A. Kudynov, L.T. Parkhuts, V.A. Khoroshko, “Optimization of the structure of the information network”, Zakhyst informatsii, № 3, pp. 44 – 49, 2004. (in Russian).
V.A. Kudynov, D.V. Plus, V.A. Khoroshko, D.V. Chyrkov, “The synthesis method of the optimal topological structure”, Zakhyst informatsii, №1, pp. 12-21, 2005. (in Russian).
J. Edmonds, “Optimum branchings”, J. Res. Natl. Bur. Stand., № 71B, pp. 233 – 240, 1967. (in English).
D. R. Fulkerson, “Packing rooted directed cuts in a weighted directed graf”, Mathematical Programming, № 6, pp. 1 – 13, 1974. (in English).
J. L. Gross, Ja.Yellen, M. Anderson, Graph Theory and Its Applications. 3rd Edition. Chapman and Hall/CRC, 2019, p. 577. (in English).
"Criteria for evaluating information security in computer systems against unauthorized access", ND TZI 2.5-004-99. (in Ukrainian).
