Flows distribution estimations at maximum load of multiuser network

An iterative method of sequential distribution of a multiproduct flow which allows full using of the capacity of all network edges is considered. Within the framework of a formal mathematical notation of a network model, flow vectors are determined that can be simultaneously transmitted between all pairs of vertices. Joint distributions of flows are found sequentially, at which the maximum possible load of one of the edges is achieved. The achieved flow values for all corresponding node pairs are recorded and the remaining capacity is calculated. At the next stage, the problem of finding the joint distribution of the maximum possible flows is solved again, and the next edge, whose capacity is exhausted, is identified. The procedure is repeated until the remaining capacity of all edges is equal to zero. The results of computational experiments on network models with different structural features are analyzed. The proposed procedure can be used for a priori analysis of functionality and for evaluating the efficiency of using network resources.