Algorithm for dynamic channel reservation of aggregated data flow

DOI: 10.31673/2412-9070.2022.041721

Abstract

In modern telecommunications systems, dynamic reservation of channel resources for an aggregated data stream is one of the most important tasks, as it allows for efficient use of available resources and provides high-quality service to subscribers. Developing an algorithm for dynamic reservation is a challenging task, as it requires ensuring optimal resource allocation among subscribers during variable network load. This article discusses an approach to developing an algorithm for dynamic reservation of channel resources for an aggregated data stream that provides efficient resource allocation and ensures high-quality service to subscribers. Specifically, approaches to dynamic resource allocation based on network load and approximation and optimization methods that reduce algorithm complexity and ensure its effective operation will be considered. The results of this work can be useful for telecommunications system developers and for research in the field of telecommunications. The article proposes an algorithm for dynamic reservation of channel resources for an aggregated data stream. The implementation of this algorithm is performed on a VPN gateway designed to manage data streams, filter them, and organize priority access to data streams in the VPN tunnel. In the event of a network load, the developed algorithm should first evaluate the network status and, based on the results obtained, perform data stream access control functions, taking into account their priorities. Based on the developed algorithm for dynamic reservation of channel resources for an aggregated real-time data stream, this section establishes a system of criteria for efficient utilization of channel resources for protected corporate multiservice communication networks under conditions of network resource availability for servicing the proposed workload from the access network and network congestion. The approach to prioritizing data streams takes into account user categories and service classes, which, unlike existing tools, allows for the task of prioritized servicing under load conditions and determines the best use of the available channel resources at the transport layer of protected corporate multiservice communication networks.

Keywords: aggregate flow; algorithm; data flow; VPN tunnels; load.

References
1. Caramanis C., Palomar D. P. Distributed Resource Allocation in Wireless Networks: A Game-Theoretic Approach // IEEE Transactions on Wireless Communications. 2009. vol. 8, no. 3. Р. 1216–1226.
2. Потокові моделі та метод балансування черг на маршрутизаторах мультисервісних телекомунікаційних мереж [Електронний ресурс]. URL: https://openarchive.nure.ua/server/api/core/bitstreams/7aeb69e3-b9da-437c-b841-f6606ee2411b/content (дата звернення: 15.01.2023).
3. Динамічне резервування пропускної здатності зворотних каналів в мережі супутникового зв’язку [Електронний ресурс]. URL: https://ir.nmu.org.ua/handle/123456789/154503?locale-attribute=en (дата звернення: 13.01.2023).
4. Alsalibi M. S., Umrao S. N. Dynamic Resource Allocation Techniques for Wireless Communication
Networks // International Journal of Advanced Research in Computer Science and Software Engineering. 2014. vol. 4, no. 6. Р. 1047–1053.
5. Sahoo S. S., Mohapatra S. S., Das A. K. Dynamic Resource Allocation in Wireless Networks: A Review // International Journal of Computer Applications. 2011. vol. 33, no. 4. Р. 38–42.
6. Система динамічного планування в розподілених обчислювальних мережах [Електронний ресурс]. URL: https://knowledge.allbest.ru/programming/2c0a65635a3ad69b5c43a88521206d37_0.html (дата звернення: 15.01.2023).