Estimate of Resource Distribution with the Shortest Paths in the Multiuser Network

Two resource distribution strategies are analyzed for the transmission of various types of flows in computational experiments on a multicommodity flow model. The resource distributed to a certain pair of nodes is understood as the total amount of capacity required to pass this type of flow along the shortest path. The sum of the flows along the edges that form the transmission route is treated as the load on the network. The developed algorithmic scheme assumes a sequential solution of a chain of lexicographically ordered problems of finding nondiscriminatory resource distributions and internodal flows. When implementing computational procedures at each iteration, a part of the available resource is distributed equally among all pairs of nodes for which there is a possibility of flow transmission. The method allows for a finite number of steps to find the final equalizing distributions of internodal flows and network resources and achieve the maximum load of all edges. The results obtained are presented in the form of special diagrams.