A Recurrent Neural Network Based Approach for Coordinating Radio and Computing Resources Allocation in Cloud-RAN

Mahdi Sharara, Sahar Hoteit, V. Vèque
{"title":"A Recurrent Neural Network Based Approach for Coordinating Radio and Computing Resources Allocation in Cloud-RAN","authors":"Mahdi Sharara, Sahar Hoteit, V. Vèque","doi":"10.1109/HPSR52026.2021.9481812","DOIUrl":null,"url":null,"abstract":"Cloud Radio Access Network (Cloud-RAN) is a novel architecture that aims at centralizing the baseband processing of base stations. This architecture opens paths for joint, flexible, and optimal management of radio and computing resources. To increase the benefit from this architecture, efficient resource management algorithms need to be devised. In this paper, we consider a coordinated allocation of radio and computing resources to mobile users. Optimal resource allocation that respects the Hybrid-Automatic-Repeat-Request deadline may require formulating high-complexity and resource-heavy algorithms. We consider two Integer Linear Programming problems (ILP) that implement a coordinated allocation of radio and computing resources with the objectives of maximizing throughput and maximizing users’ satisfaction, respectively. Since solving these highly-complex problems requires a high execution time, we investigate low-complexity alternatives based on machine learning models; more precisely on Recurrent Neural Networks (RNN). These RNN models aim to depict the performance of the ILP problems with a much lower execution time. Our simulation results demonstrate the great ability of RNN models to perform very closely to the ILP problems while being able to reduce the execution time by up to 99.65%.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR52026.2021.9481812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Cloud Radio Access Network (Cloud-RAN) is a novel architecture that aims at centralizing the baseband processing of base stations. This architecture opens paths for joint, flexible, and optimal management of radio and computing resources. To increase the benefit from this architecture, efficient resource management algorithms need to be devised. In this paper, we consider a coordinated allocation of radio and computing resources to mobile users. Optimal resource allocation that respects the Hybrid-Automatic-Repeat-Request deadline may require formulating high-complexity and resource-heavy algorithms. We consider two Integer Linear Programming problems (ILP) that implement a coordinated allocation of radio and computing resources with the objectives of maximizing throughput and maximizing users’ satisfaction, respectively. Since solving these highly-complex problems requires a high execution time, we investigate low-complexity alternatives based on machine learning models; more precisely on Recurrent Neural Networks (RNN). These RNN models aim to depict the performance of the ILP problems with a much lower execution time. Our simulation results demonstrate the great ability of RNN models to perform very closely to the ILP problems while being able to reduce the execution time by up to 99.65%.
一种基于递归神经网络的云- ran无线电和计算资源分配协调方法
云无线接入网(Cloud- ran)是一种旨在集中基站基带处理的新型体系结构。这种体系结构为无线电和计算资源的联合、灵活和优化管理开辟了道路。为了增加这种架构的好处,需要设计有效的资源管理算法。在本文中,我们考虑了无线和计算资源对移动用户的协调分配。考虑混合-自动-重复-请求时限的最优资源分配可能需要制定高复杂性和资源密集型的算法。我们考虑了两个整数线性规划问题(ILP),它们分别以吞吐量最大化和用户满意度最大化为目标,实现了无线电和计算资源的协调分配。由于解决这些高度复杂的问题需要很高的执行时间,我们研究了基于机器学习模型的低复杂性替代方案;更准确地说,是在递归神经网络(RNN)上。这些RNN模型旨在以更低的执行时间描述ILP问题的性能。我们的仿真结果表明,RNN模型的执行能力非常接近于ILP问题,同时能够将执行时间缩短高达99.65%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信