Informatics and Applications
2021, Volume 15, Issue 4, pp 20-26
ANALYSIS OF PEAK LOAD DISTRIBUTION IN THE MULTIUSER NETWORK
- Yu. E. Malashenko
- I. A. Nazarova
Abstract
Within the framework of a multicommodity network model, nondiscriminatory distribution of the tantamount flows of various types transmitted between all pairs of nodes simultaneously is analyzed. When setting and solving optimization problems, the resource required by a certain source-receiver pair is treated as the sum of the capacity values of all edges located on all routes of this source-receiver flow. The sum of the corresponding edge flows is interpreted as the total load on the network occurring during a transmission of this internode flow.
A nuclear-chain of lexicographically ordered problems of searching for routes with equal loads for source-receiver pairs is solved in computational experiments. At each iteration, a vector of peak values of jointly permissible internode flows is used for assessment of the system's functionality. The method allows for a finite number of steps to find the final nondiscriminating maximin distribution of resources providing the peak load of all network edges.
[+] References (8)
- Malashenko, Yu. E., and I. A. Nazarova. 2021. Analysis of the equal share and equalitarian flow distributions under the peak load of the multi-user network. J. Comput. Sys. Sc. Int. 60(5):889–897.
- Baier G., Kohler E., and M. Skutella. 2005. The k-splittable flow problem. Algorithmica 42(3-4):231-248.
- Kabadurmus, O., and A. E. Smith. 2016. Multicommodity k-splittable survivable network design problems with relays. Telecommun. Syst. 62(1):123-133.
- Bialon, P. 2017. A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees. Telecommun. Syst. 64(3):525-542.
- Georgiadis, L., P. Georgatsos, K. Floros, and S. Sartzetakis. 2001. Lexicographically optimal balanced networks. IEEE INFOCOM Ser. 2:689-698.
- 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. N. Doan, O. Klopfenstein, and A. Bashllari. 2008. Max-min fairness in multicommodity flows. Comput. Oper. Res. 35(2):557-573.
- Zoutendijk, G. 1960. Methods of feasible directions. Amsterdam: Elsevier Publishing Co. 126 p.
[+] About this article
Title
ANALYSIS OF PEAK LOAD DISTRIBUTION IN THE MULTIUSER NETWORK
Journal
Informatics and Applications
2021, Volume 15, Issue 4, pp 20-26
Cover Date
2021-12-30
DOI
10.14357/19922264210403
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
multiuser network; equalizing maximum peak load distribution; network peak load; functional characteristics
Authors
Yu. E. Malashenko  and I. A. Nazarova
Author Affiliations
Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
|