Algorithm and model of information streams in the digital communication system

As the analysis of the growth rates of the information load in the technologies of digital communication systems (DCS) development, providing an increase in the speed of information transfer over the communication channel, shows, it does not allow to fully meet all the requirements for the implementation and support of information exchange between switching nodes (SN). Therefore, in modern conditions there are situations of DCS overload in the lower sections (in communication channels (CC) or repeater nodes), as well as partial or complete packet losses during the route transmission of information. This circumstance causes a contradiction between the limited channel-network connections of the DCS and the possibilities of effective distribution of the level of constant incoming traffic. In turn, this determines the relevance and undoubted practical innovativeness of solutions that allow effective distribution of information flows (routing) to ensure efficiency and effective information exchange in the DCS in order to ensure guaranteed delivery of packets to the British recipient using formal algorithms according to a given criterion (for example, with a minimum time delay, with a consequence of losses, with maximum DCS performance). Existing approaches and routing algorithms implemented on the basis of information exchange protocols using local metric parameters in their work do not allow to fully ensure the resolution of the said contradiction. A promising direction for solving the problems of distributing information flows in the centralized communication network is the use of a generalized indicator for the formation of routing metrics, which, when selecting the route for transmitting information, constantly monitors the speed characteristics and the load of the control center on individual communication intervals.