Analysis of Nodal Multiflows in a Multiuser System with Equalizing Control Strategies

Cover Page

Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Within the framework of computational experiments on a mathematical model of a multiuser network communication system, the dynamics of changes in the indicators of the functioning of a telecommunications network are studied. The proposed algorithmic scheme makes it possible to sequentially form component-by-component nondecreasing vectors of permissible outgoing nodal multiflows. The model assumes that the transmission of interstitial flows of different types is carried out simultaneously from all nodes by all nodes along all routes with the minimum number of edges. During the calculations, resources are distributed in equal shares at each step until the network is fully loaded. The results obtained during the experiments make it possible to trace changes in the values of quotas distributed to the nodes for transmitting a certain type of flow. The found vectors of allowable outgoing nodal multiflows can be considered as guaranteed multicriterial estimates of the functioning of a multiuser system. Networks with different structural features and equal total capacity are analyzed. Special diagrams are provided.

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

  1. Малашенко Ю.Е., Назарова И.А. Управление распределением ресурсов при выравнивании нагрузок и межузловых потоков в многопользовательской сети // Изв. РАН. ТиСУ. 2023. № 5. С. 91–102.
  2. Малашенко Ю.Е., Назарова И.А. Оценки распределения ресурсов в многопользовательской сети при равных межузловых нагрузках // Информатика и ее применения. 2023. Т. 17. Вып. 1. С. 21–26.
  3. Малашенко Ю.Е., Назарова И.А. Анализ загрузки многопользовательской сети при расщеплении потоков по кратчайшим маршрутам // Информатика и ее применения. 2023. Т. 17. Вып. 3. С. 19–24.
  4. Гермейер Ю.Б. Введение в теорию исследования операций. М.: Наука, 1971.
  5. 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.
  6. Ogryczak W., Luss H., Pioro M. et al. Fair Optimization and Networks: A Survey // J. Appl. Math. 2014. V. 3. P. 1–25.
  7. Luss H. Equitable Resource Allocation: Models, Algorithms, and Applications. Hoboken: John Wiley & Sons, 2012.
  8. 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.
  9. Моудера Дж., Элмаграби С. Исследование операций. Модели и применения. Т. 2. М.: Мир, 1981.
  10. Йенсен П., Барнес Д. Потоковое программирование. М.: Радио и связь, 1984.
  11. Кормен Т.Х., Лейзерсон Ч.И., Ривест Р.Л. и др. Алгоритмы: построение и анализ. М.: Вильямс, 2005.

Supplementary files

Supplementary Files
Action
1. JATS XML
2.

Download (105KB)
3.

Download (115KB)
4.

Download (98KB)
5.

Download (99KB)
6.

Download (101KB)
7.

Download (108KB)
8.

Download (121KB)
9.

Download (127KB)
10.

Download (135KB)
11.

Download (135KB)


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies