Using of the contour method to solving the problem of optimal traffic dis-tribution in the network

Abstract

The purpose of this work is to create a method for solving the problem of optimal traffic distribution in a network using the contour data analysis method. In the first section of the work, the principle of converting any available network to a contour form is explained, and the case is considered both for networks without loss and for networks with losses. The second section shows in a general way the method of bringing the network in contour form to a system of non-linear inequalities, by solving which one can obtain a certain distribution of traffic in the system. In the final section, using the M/M/1/N queuing system as an example, the solution of the problem of optimal traffic distribution according to the loss minimization criterion is shown. The initial data for the task were the incidence matrix, service intensity and buffer dimension for communication channels. A feature of the proposed algorithm is the search for a contour matrix, for the compilation of which it is proposed to use loss edges as elements of the spanning tree of the graph, which allows you to immediately determine the contour matrix using the concept of a fundamental cycle of a graph. This approach to optimal traffic distribution reduces the number of variables used compared to the known methods based on loopless routes, and also does not require their preliminary search, since they are determined from the dimension of the incidence matrix of the simulated network graph.