## 1 Introduction  
The efficiency of using communication-channel resources is one of the most important problems of the telecommunication industry, since it enables us, on the one hand, to maximize the use of network resources, thereby increasing the profitability of the services provided, and, on the other hand, to ensure improved quality of service indicators by reducing delay time and probability losses. For the efficient use of network resources in telecommunication networks, routing protocols dynamically alter the routes of information flows [1; 2; 3; 4]. When developing a routing protocol, two factors are essential: the choice of optimality criterion for the route search method and the rate of changes in the network topology. The algorithm for finding the optimum of the objective function (criterion) should be many times faster than changing the network topology. The classic optimality criterion can be considered an optimal multipath routing according to the criterion of total delay time, described by the authors of [5]. Firstly, the intention is to find a set of simple routes between each pair of \"Sources\" and \"Destinations\". [PERSON]'s algorithm [6] is mostly used for this purpose as it enables the search for k-shortest paths. The disadvantage of this approach is the necessity to find all pairs of loopless routes between all pairs of \"Sources\" and \"Destinations\", and that leads to a rapid complication of the optimization problem due to an increase in the number of state variables while providing an optimal solution. The situation can be improved by selectingonly those routes satisfying certain criteria [7; 8; 9; 10; 11]. As a rule, such criteria are specified in the form of graph weights that reflect certain characteristics of the channel; such algorithms can also be used as independent ones. Another approach to the route selection is finding routes that do not have common edges, or the set of common edges is minimal [12]. The optimality criterion in [5] is the total delay time due to delays in the network device interface buffer. Based on the found routes of information flows, the total flow through each communication channel is determined. Afterwards, using the delay time equation for the M/M/1 queuing system, it is possible to estimate the objective function as the sum of all delay times in all channels. This approach with various modifications is used in many works, where a certain cost function is selected as an optimality criterion, which depends on the total flow [13; 14; 15], thereby causing linear and nonlinear programming problems. Such approaches are valid in the case of no information loss or in the case when the losses can be neglected, since in such cases it is possible to obtain the objective function in an explicit form with a linear set of constraints (inequalities). An alternative to mathematical models based on routes are mathematical models based on flows in communication channels [16], which, starting from a certain graph density, have a lower dimension (fewer number of state variables) than models based on flows. The closest concepts to the algorithm proposed in this paper have been presented in [17; 18], which consider cell losses in the ATM network. The relevance of the problem being solved is due to the emergence of new types of wireless networks with variable topologies, where the solution of routing problems is especially important due to limited radio frequency resources. Such networks include FANAET and MANET, which are satellite networks in low and medium orbits.