A.M. Mezhuev1, K.A. Kobelev2, D.L. Sturov3, A.V. Korennoi4

1–4 VUNTS of the Air Force «VVA» (Voronezh)

1 multitenzor@mail.ru, 2 konst.kobelev@mail.ru, 3 777dmitry.sturov777@gmail.com, 4 korennoj@mail.ru

Modern digital communication systems (DCS) operate in conditions of rapid growth of the volume of transmitted information and increasing requirements for QoS parameters (from English. Quality of Service), such as average time delay, packet loss and resistance to overloads. A multiple increase in the intensity of incoming traffic, as well as an increase in the number of switching nodes (YK) in the DCS leads to uneven loads on the network, which, in turn, leads to overloads in individual SNs and in entire segments of the system, reducing the efficiency of information exchange (IE). In this case, a contradiction arises between the available channel-network resource of the DCS and the possibility of its effective use to provide IE with the required quality in conditions of high incoming traffic. The resolution of this contradiction is ensured by optimal distribution of information flows (routing) taking into account the capabilities of the DCS for the transmission and storage of information. At the same time, the overwhelming majority of routing algorithms, which are the basis of network interaction protocols, use local metric parameters in their work (the number of transitions (hops), the load of communication channels (CC), etc.), which does not allow to take into account the state of the entire CSN in full and leads to inefficient use of network resources. An obvious solution to this problem is to use an integrated approach to the distribution of information flows, taking into account the capabilities of the system for transmitting and storing information. The use of a generalized indicator in the distribution of information flows (routing) allows to ensure a more balanced network load, minimize the number of losses and packet delays, and increase the performance of the CSN. In this regard, an urgent task is to develop and study a simulation model of IO in the CSN, which allows to implement and compare various algorithms for distributing information flows (routing) under conditions of high intensity of change in input traffic. Such a model makes it possible to experimentally evaluate the effectiveness of new approaches and justify the feasibility of their implementation in the practice of designing and operating the CSN.

Mezhuev A.M., Kobelev K.A., Sturov D.L., Korennoi A.V. Model of information exchange in a digital communication system using various algorithms for distributing information flows. Electromagnetic waves and electronic systems. 2025. V. 30. № 6. P. 16−36. DOI: https://doi.org/10.18127/j15604128-202506-02 (in Russian)

1. Schwartz M. Communication networks: protocols, modeling and analysis. Part 1. Transl. from En. by V.I. Neiman. Moscow: Nauka. 1992. 336 p. (in Russian)
2. Goldsmith A. Wireless communications. Moscow: Technosphere. 2011. 904 p. (in Russian)
3. Kleinrock L. Communication networks (stochastic flows and message delays). Moscow: Nauka. 1970. 256 p. (in Russian)
4. Bersekas D., Gallagher R. Data transmission networks. 2nd Ed. New Jersey. 1992. 556 p. (in Russian)
5. Kleinrock L., Gail R. Queueing Systems: Problems and Solutions. Wiley-Interscience. 1996. 240 p.
6. Pasechnikov I.I. Methodology of analysis and synthesis of extremely loaded information networks: monograph. Moscow: Mashino-stroenie-1. 2004. 216 p. (in Russian)
7. Parfenov V.I., Zolotarev S.V. Tensor approach to solving the problem of optimal routing in information networks. Theory and technology of radio communication. 2007. № 2. P. 5–11. (in Russian)
8. Kartashevsky V.G. Fundamentals of queuing theory: a textbook for universities. Moscow: Hotline-Telecom. 2013. 130 p. (in Russian)
9. Request for Comments (RFC): 1058 Routing Information Protocol. Network Working Group. Rutgers University. 1988. 33 p.
10. Request for Comments (RFC): 2453 RIP Version 2. Network Working Group. Bay Networks. 1998. 39 p.
11. Request for Comments (RFC): 2328 OSPF Version 2. Network Working Group. Ascend Communications, Inc. 1998. 244 p.
12. Mezhuev A.M., Korennoi A.V. Estimation of efficiency of the network information systems on the basis of the generalized index. Radiotekhnika. 2021. V. 85. № 3. P. 65−77. DOI 10.18127/j00338486-202103-07. (in Russian)
13. Mezhuev A.M., Kobelev K.A., Sturov D.L., Babusenko S.I. Method of allocation of information streams in the digital communication system. Radiotekhnika. 2024. V. 88. № 7. P. 92−103. DOI 10.18127/j00338486-202407-18. (in Russian)
14. Mezhuev A.M., Kobelev K.A., Sturov D.L., Kulbashny I.A. Algorithm and model of information streams in the digital communication system. Science Intensive Technologies. 2025. V. 26. № 2. P. 5−19. DOI 10.18127/j19998465-202502-01. (in Russian)
15. Patent for invention RUS 2835571 dated 28.02.2025. A method for determining the optimal route for transmitting information in a communication system. Mezhuyev A.M., Kobelev K.A., Sturov D.L., Mezhuyev D.A., Pankratiev A.N. (in Russian)
16. Boev V.D. A study of the adequacy of GPSS World and AnyLogic in modeling discrete event processes: monograph. SPb.: VAS. 2011. 404 p. (in Russian)
17. Nazarov A.N., Sychev K.I. Models and methods for calculating performance indicators of node equipment and structural and network parameters of next-generation communication networks. Krasnoyarsk: Polikom. 2010. 389 p. (in Russian)
18. Shelukhin O.I., Tenyakshev A.M., Osin A.V. Modeling of information systems: textbook. manual. Moscow: Radio Engineering. 2005. 368 p. (in Russian)