Email this article Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network
- Authors: Malashenko Y.E.1, Nazarova I.A.1
-
Affiliations:
- Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia
- Issue: No 2 (2023)
- Pages: 164-176
- Section: СИСТЕМНЫЙ АНАЛИЗ И ИССЛЕДОВАНИЕ ОПЕРАЦИЙ
- URL: https://journals.rcsi.science/0002-3388/article/view/136886
- DOI: https://doi.org/10.31857/S0002338823020130
- EDN: https://elibrary.ru/JEVYNL
- ID: 136886
Cite item
Open Access
Access granted
Subscription Access
Abstract
Strategies are considered for the distribution of flows over various transmission routes in a multicommodity network model. Estimates of feasible network loads are formed based on the vector of jointly feasible internodal flows. Two distribution strategies are studied. When implementing the first one, the transmitted internodal flows are equal to each other. The second strategy assumes the search for a nondiscriminatory distribution of flows, during the transmission of which equal value resources are achieved. The load created by a certain pair of nodes is understood as the total capacity required to provide the given type of connection. To estimate the minimum specific resources for the transmission of a flow of a certain type, all the shortest paths between the corresponding pair of nodes are constructed. To obtain an upper estimate of resources when connecting each pair of nodes, the maximum single-product flow is calculated along all the network edges. Computational experiments were carried out for networks with different structures that make it possible to carry out a comparative analysis of equalizing distribution strategies when splitting internodal flows for transmission along different routes.
About the authors
Yu. E. Malashenko
Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia
Email: irina-nazar@yandex.ru
Россия, Москва
I. A. Nazarova
Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia
Author for correspondence.
Email: irina-nazar@yandex.ru
Россия, Москва
References
- Малашенко Ю.Е., Назарова И.А. Оценки распределения ресурсов в многопользовательской сети при равных межузловых нагрузках // Информатика и ее применения. 2023. Т. 33. № 1. С. 21–26.
- Малашенко Ю.Е., Назарова И.А. Оценки распределения потоков при предельной загрузке многопользовательской сети // Системы и средства информатики. 2022. Т. 32. № 3. С. 71–80.
- Малашенко Ю.Е. Максимальные межузловые потоки при предельной загрузке многопользовательской сети // Информатика и ее применения, 2021. Т. 15. № 3. С. 24–28.
- Salimifard K., Bigharaz S. The Multicommodity Network Flow Problem: State of the Art Classification, Applications, and Solution Methods // J. Oper. Res. Int. 2020. V. 22. Iss. 2. P. 1–47.
- Ogryczak W., Luss H., Pioro M. et al. Fair Optimization and Networks: A Survey // J. Appl. Math. 2014. V. 3. P. 1–25.
- Luss H. Equitable Resource Allocation: Models, Algorithms, and Applications. Hoboken: John Wiley & Sons, 2012.
- Balakrishnan A., Li G., Mirchandani P. Optimal Network Design with End-to-End Service Requirements // Oper. Res. 2017. V. 65. Iss. 3. P. 729–750.
- Radunovic B., Le Boudec J.-Y. A Unified Framework for Max-Min and Min-Max Fairness With Applications // IEEE/ACM Transactions on Networking. 2007. V. 15. Iss. 5. P. 1073–1083.
- Nace D., Doan L.N., Klopfenstein O. et al. Max-min Fairness in Multicommodity Flows // Comput. Oper. Res. 2008. V. 35. Iss. 2. P. 557–573.
- Baier G., Kohler E., Skutella M. The k-Splittable Flow Problem // Algorithmica. 2005. V. 42. Iss. 3–4. P. 231–248.
- Kabadurmus O., Smith A.E. Multicommodity k-Splittable Survivable Network Design Problems with Relays // Telecommun. Syst. 2016. V. 62. Iss. 1. P. 123–133.
- Bialon P. A Randomized Rounding Approach to a k-Splittable Multicommodity Flow Problem with Lower Path Flow Bounds Affording Solution Quality Guarantees // Telecommun. Syst. 2017. V. 64. Iss. 3. P. 525–542.
- Ramaswamy R., Orlin J.B., Chakravarti N. Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs // Math. Prog. 2005. V. 102. Iss. 2. P. 355–369.
- Hajjem M., Bouziri H., Talbi E.-G. A Metaheuristic Framework for Dynamic Network Flow Problems // Recent Developments in Metaheuristics. Operations Research/Computer Science Interfaces Series. V. 62. Cham: Springer, 2018. P. 285–304.
- Йенсен П., Барнес Д. Потоковое программирование. М.: Радио и связь, 1984.
- Кормен Т.Х., Лейзерсон Ч.И., Ривест Р.Л. и др. Алгоритмы: построение и анализ. М.: Вильямс, 2005.
- Берж К. Теория графов и ее применения. М.: Изд-во иностр. лит., 1962.
Supplementary files
