Multiuser network load analysis by splitting flows along the shortest routes

In computational experiments on a multicommodity network model, two ways of transmitting flows of different types along shortest routes are investigated. In the first case, the transmitted internodal flows are equal in magnitude. In the other — a nondiscriminatory distribution is defined in which all pairs of nodes are distributed the same resources. The total load of the network edges resulting from the simultaneous transmission of all internodal flows is considered to be given. The proposed method allows one to obtain guaranteed estimates of the specific resource costs of the network and the maximum feasible load of the edges while transmitting split internodal flows along the shortest routes found. The results of a comparative analysis of the equalization distribution of flows and resources in networks with different structural features are given. The algorithmic scheme has a polynomial estimate of the required number of operations.