Systems and Means of Informatics
2022, Volume 32, Issue 3, pp 71-80
ANALYSIS OF THE DISTRIBUTION OF LOADS AND RESOURCES IN A MULTIUSER NETWORK WITH EQUAL-SHARE INTERNODAL FLOWS
- Yu. E. Malashenko
- I. A. Nazarova
Abstract
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.
[+] References (11)
- Malashenko, Yu.E., and I. A. Nazarova. 2022. Heterogeneous flow distribution at the peak load in the multiuser network. J. Comput. Sys. Sc. Int. 61(3):372-387.
- Malashenko, Yu. E., and I. A. Nazarova. 2022. Estimate of resource distribution with the shortest paths in the multiuser network. J. Comput. Sys. Sc. Int. 61(4):599-610.
- Ogryczak, W., H. Luss, and M. Pioro. 2014. Fair optimization and networks: A survey. J. Appl. Math. 3:1-25.
- Salimifard, K., and S. Bigharaz. 2020. The multicommodity network flow problem: State of the art classification, applications, and solution methods. Oper. Res. - Ger. 18(3): 1-47.
- Luss, H. 2012. Equitable resource allocation: Models, algorithms, and applications. Hoboken, NJ: John Wiley & Sons. 420 p.
- Balakrishnan, A., G. Li , and P. Mirchandani. 2017. Optimal network design with end-to-end service requirements. Oper. Res. 65(3):729-750.
- Hahne E.L. 1991. Round-robin scheduling for max-min fairness in data networks. IEEE J. Sel. Area. Comm. 9(7):1024-1039.
- Radunovic, B., and J.-Y. Le Boudec. 2007. A unified framework for max-min and min-max fairness with applications. IEEE ACM T. Network. 15(5):1073-1083.
- Nace, D., L. Doan, and O. Klopfenstein. 2008. Max-min fairness in multicommodity flows. Comput. Oper. Res. 35(2):557-573.
- Ros-Giralt, J., and W. K. Tsai. 2010. A lexicographic optimization framework to the flow control problem. IEEE T. Inform. Theory 56(6):2875-2886.
- Jensen, P. A., and J. W. Barnes. 1980. Network flow programming. New York, NY: Wiley. 408 p.
[+] About this article
Title
ANALYSIS OF THE DISTRIBUTION OF LOADS AND RESOURCES IN A MULTIUSER NETWORK WITH EQUAL-SHARE INTERNODAL FLOWS
Journal
Systems and Means of Informatics
Volume 32, Issue 3, pp 71-80
Cover Date
2022-06-11
DOI
10.14357/08696527220307
Print ISSN
0869-6527
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
multicommodity flow model; network resource distribution method; equalizing distribution of interstitial flows; network peak load
Authors
Yu. E. Malashenko  and I. A. Nazarova
Author Affiliations
Federal Research Center "Computer Science and Control", Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
|