The aim of the work is to investigate the possibility of increasing the efficiency of the data transmission system based on randomized routing algorithms. Routing algorithms using randomized routing tables are studied.
The formation of randomized tables is carried out on the basis of the optimal flows’ distribution along the routes of the data transmission network. Analysis and optimization are carried out on a formalized model that allows to take into account the carrying capacity of communication lines and repeaters, indexes of switching centers, as well as the information load in the information directions of the system.
An algorithm for the optimal distribution of flows along the routes has been developed. It allows the use of various options for specifying the efficiency index, on the basis of which a system of generally randomized routing tables is formed, that implements the optimal flows’ distribution along the network routes in accordance with the specified proximity indicator. An example of the algorithm of optimal flows’ distribution for a network with five switching centers providing the maximization of the probability of messages’ timely delivery is given. Examples of tables of non-randomized (classical) and randomized routing are presented. When randomized routing tables based on the optimal allocation of flows are used, the estimated value of the system performance indicator is guaranteed.
The developed methods and algorithms for the generation of routing tables are supposed to be used to automate the management of the message packets’ routing in the data transmission network when its state and operating conditions change.
Keywords: data communication network; packet routing; randomized routing; flow distribution; probability of messages’ timely delivery.