Methods for determining the equilibrium state of a network with given flows in nodes of information networks of cyber-physical systems
DOI:
https://doi.org/10.17721/ISTS.2025.9.93-101Keywords:
software complex, network traffic, matrices, graphs, entropy, Hessian matrices, submatrixAbstract
Background. The multidimensionality of cyberspace and the high level of informatization of critical infrastructure objects, both in Ukraine and globally, pose a threat to humanity at the global level in the foreseeable future. The situation is complicated by the fact that critical infrastructure objects, which operate within a unified information space and support a wide range of modern information technologies, remain vulnerable to new types of threats, despite tremendous efforts to counteract external cyber intrusions.
Methods. It has been identified that the study of complex systems employs modern mathematical methods such as topology, graph theory, and linear algebra.
Results. The entropic method for analyzing complex systems has found wide application in practical problems related to the study of natural, technical, and cyber-physical systems. This method has long been used to develop efficient systems for coding, encryption, and information protection. With the increase in computational power, the practical value of researching dynamic systems – including those based on entropy – has grown, as entropy serves as a good indicator for selecting certain states of a system from the set of all its possible states.
Conclusions. Since the study of structures and general patterns is common across many branches of science and technology, tasks of a general nature – where the specific nature of the system is not taken into account – remain relevant. This study presents an algorithm for determining the state of a multi-node information flow network in which its entropy reaches a maximum value. The algorithm is based on analytical expressions for entropy and its first and second derivatives, derived by the authors and defined on the set of kernel solutions of a system of linear equations to which the original problem is reduced. Experimental results are presented for determining the solution set and solving the optimization problem of finding the state with the maximum entropy value for networks with 3, 4, 5, and 6 nodes. Possibilities for further improvement of the method for calculating more complex networks are analyzed.
Downloads
References
Beshley, M., Toliupa, S., Pashkevych, V., & Kolodiy, R. (2018). Development of software system for network traffic analysis and intrusion detection. 2018 International Conference on Information and Telecommunication Technologies and Radio Electronics, UkrMiCo 2018 – Proceedings. Igor Sikorsky Kyiv Polytechnic Institute. https://doi.org/10.1109/UkrMiCo43733.2018.9047546
Garofalakis, M. N., Gehrke, J., & Rastogi, R. (Eds.). (2016). Data stream management – Processing high-speed data streams. Data-Centric Systems and Applications. Springer. https://doi.org/10.1007/978-3-540-28608-0
Li, X., & Sun, Q. (2021). Identifying and ranking influential nodes in complex networks based on dynamic node strength. Algorithms, 14(3), 82. https://doi.org/10.3390/a14030082
Madarro-Capó, E. J., Legón-Pérez, C. M., Rojas, O., & Sosa-Gómez, G. (2021). Information theory based evaluation of the RC4 stream cipher outputs. Entropy, 23(7), 896. https://doi.org/10.3390/e23070896
Miletic, S., Pokrajac, I., Pena-Pena, K., Arce, G. R., & Mladenovic, V. A. (2022). Multigraph-defined distribution function in a simulation model of a communication network. Entropy, 24(9), 1294. https://doi.org/10.3390/e24091294
Niven, R. K., Abel, M., Schlegel, M., & Waldrip, S. H. (2019). Maximum entropy analysis of flow networks: Theoretical foundation and applications. Entropy, 21(8), 776. https://doi.org/10.3390/e21080776
Pedrosa, V. G., & Costa, M. H. M. (2022). Index coding with multiple interpretations. Entropy, 24(8), 1149. https://doi.org/10.3390/e24081149
Politanskyi, R. L., Bobalo, Y. Y., Zarytska, O. L., Kiselychyk, M. D., & Vistak, M. V. (2022). Entropy calculation for networks with determined values of flows in nodes. Mathematical Modelling and Computing, 9(4), 936–944. https://doi.org/10.23939/mmc2022.04.936
Shahar, A., Alfassi, Y., & Keren, D. (2022). Communication efficient algorithms for bounding and approximating the empirical entropy in distributed systems. Entropy, 24(11), 1611. https://doi.org/10.3390/e24111611
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Information systems and technologies security

This work is licensed under a Creative Commons Attribution 4.0 International License.
