A novel machine learning-based framework for channel bandwidth allocation and optimization in distributed computing environments

EURASIP Journal on Wireless Communications and Networking

Research

Miaoxin Xu¹ 

[1] China United Network Communications Corporation Shangqiu Branch, 476000, Shangqiu, China;

关键词: Reinforming learning;    Channel bandwidth allocations;    Optimization;    Machine learning;   

DOI  :  10.1186/s13638-023-02310-y

 received in 2023-08-10, accepted in 2023-09-23,  发布年份 2023

来源: Springer

【 摘 要 】

Efficient utilization of network resources, particularly channel bandwidth allocation, is critical for optimizing the overall system performance and ensuring fair resource allocation among multiple distributed computing nodes. Traditional methods for channel bandwidth allocation, based on fixed allocation schemes or static heuristics, often need more adaptability to dynamic changes in the network and may not fully exploit the system’s potential. To address these limitations, we employ reinforcement learning algorithms to learn optimal channel allocation policies by intermingling with the environment and getting feedback on the outcomes of their actions. This allows devices to adapt to changing network conditions and optimize resource usage. Our proposed framework is experimentally evaluated through simulation experiments. The results demonstrate that the framework consistently achieves higher system throughput than conventional static allocation methods and state-of-the-art bandwidth allocation techniques. It also exhibits lower latency values, indicating faster data transmission and reduced communication delays. Additionally, the hybrid approach shows improved resource utilization efficiency, efficiently leveraging the strengths of both Q-learning and reinforcement learning for optimized resource allocation and management.

【 授权许可】

CC BY   
© Springer Nature Switzerland AG 2023

【 图 表 】

13690_2023_1170_Article_IEq201.gif

13690_2023_1170_Article_IEq200.gif

12888_2023_5142_Article_IEq11.gif

Fig. 2

Fig. 1