Analysis of the distribution of loads and resources in a multiuser network with equal-share internodal flows

An iterative method of resource distribution for the formation of a communication network with equal internodal flows is considered. Within the framework of a formal mathematical model, the throughput capacities of edges are considered as components of a vector of resources of various types that are required for the transmission of different types of flows. The network graph and the sum of the edge capacity are considered to be given. An algorithmic procedure for selecting throughput capacities is proposed in which all internodal flows are equal and the maximum load of all network edges is achieved. When searching for the corresponding distributions, the values of the maximum single-product flows are used which are determined for each pair of nodes. The computational experiments were carried out for the networks with various structural features.