Systems and Means of Informatics
2020, Volume 30, Issue 3, pp 413
FLOWS DISTRIBUTION ESTIMATIONS AT MAXIMUM LOAD OF MULTIUSER NETWORK
 Yu. E. Malashenko
 I. A. Nazarova
Abstract
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.
[+] References (6)
 Malashenko, Yu.E., and I. A. Nazarova. 2020. Approksimatsiya mnozhestva dostizhimykh potokov mnogopol'zovatel'skoy seti [Approximation of the multiuser network feasible flows set]. Informatika i ee Primeneniya  Inform. Appl. 14(3):3943.
 Malashenko, Yu.E., I. A. Nazarova, and N.M. Novikova. 2019. An approach to the analysis of possible structural damages in multicommodity network systems. Comp. Math. Math. Phys. 59(9): 15621574.
 Malashenko, Yu.E., and I. A. Nazarova. 2020. Analysis of critical damage to the communication network. II. Guaranteed functional performance evaluations. J. Comput. Sys. Sc. Int. 59(6):879890.
 Malashenko, Yu. E., I. A. Nazarova, and N. M. Novikova. 2019. Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system. J. Comput. Sys. Sc. Int. 58(6):889897.
 Jensen, P. A., and J. W. Barnes. 1980. Network flow programming. New York, NY: Wiley. 408 p.
 Bertsekas, D.P., and R. G. Gallager. 1973. Data networks. Englewood Cliffs, NJ: Prentice Hall. 556 p.
[+] About this article
Title
FLOWS DISTRIBUTION ESTIMATIONS AT MAXIMUM LOAD OF MULTIUSER NETWORK
Journal
Systems and Means of Informatics
Volume 30, Issue 3, pp 413
Cover Date
20201110
DOI
10.14357/08696527200301
Print ISSN
08696527
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
feasible flows set; equalshared flows distribution; network efficiency estimation
Authors
Yu. E. Malashenko and I. A. Nazarova
Author Affiliations
Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
