Affiliation:
1. Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia
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.
Publisher
The Russian Academy of Sciences
Reference17 articles.
1. Малашенко Ю.Е., Назарова И.А. Оценки распределения ресурсов в многопользовательской сети при равных межузловых нагрузках // Информатика и ее применения. 2023. Т. 33. № 1. С. 21–26.
2. Малашенко Ю.Е., Назарова И.А. Оценки распределения потоков при предельной загрузке многопользовательской сети // Системы и средства информатики. 2022. Т. 32. № 3. С. 71–80.
3. Малашенко Ю.Е. Максимальные межузловые потоки при предельной загрузке многопользовательской сети // Информатика и ее применения, 2021. Т. 15. № 3. С. 24–28.
4. 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.
5. Ogryczak W., Luss H., Pioro M. et al. Fair Optimization and Networks: A Survey // J. Appl. Math. 2014. V. 3. P. 1–25.