Near-optimal Cloud-Network Integrated Resource Allocation for Latency-Sensitive B5G

Masoud Shokrnezhad, T. Taleb
{"title":"Near-optimal Cloud-Network Integrated Resource Allocation for Latency-Sensitive B5G","authors":"Masoud Shokrnezhad, T. Taleb","doi":"10.1109/GLOBECOM48099.2022.10001109","DOIUrl":null,"url":null,"abstract":"Nowadays, while the demand for capacity continues to expand, the blossoming of Internet of Everything is bringing in a paradigm shift to new perceptions of communication networks, ushering in a plethora of totally unique services. To provide these services, Virtual Network Functions (VNFs) must be established and reachable by end-users, which will generate and consume massive volumes of data that must be processed locally for service responsiveness and scalability. For this to be realized, a solid cloud-network Integrated infrastructure is a necessity, and since cloud and network domains would be diverse in terms of characteristics but limited in terms of capability, communication and computing resources should be jointly controlled to unleash its full potential. Although several innovative methods have been proposed to allocate the resources, most of them either ignored network resources or relaxed the network as a simple graph, which are not applicable to Beyond 5G because of its dynamism and stringent QoS requirements. This paper fills in the gap by studying the joint problem of communication and computing resource allocation, dubbed CCRA, including VNF placement and assignment, traffic prioritization, and path selection considering capacity constraints as well as link and queuing delays, with the goal of minimizing overall cost. We formulate the problem as a non-linear programming model, and propose two approaches, dubbed B&B-CCRA and WF-CCRA respectively, based on the Branch & Bound and Water-Filling algorithms. Numerical simulations show that B&B-CCRA can solve the problem optimally, whereas WF-CCRA can provide near-optimal solutions in significantly less time.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM48099.2022.10001109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Nowadays, while the demand for capacity continues to expand, the blossoming of Internet of Everything is bringing in a paradigm shift to new perceptions of communication networks, ushering in a plethora of totally unique services. To provide these services, Virtual Network Functions (VNFs) must be established and reachable by end-users, which will generate and consume massive volumes of data that must be processed locally for service responsiveness and scalability. For this to be realized, a solid cloud-network Integrated infrastructure is a necessity, and since cloud and network domains would be diverse in terms of characteristics but limited in terms of capability, communication and computing resources should be jointly controlled to unleash its full potential. Although several innovative methods have been proposed to allocate the resources, most of them either ignored network resources or relaxed the network as a simple graph, which are not applicable to Beyond 5G because of its dynamism and stringent QoS requirements. This paper fills in the gap by studying the joint problem of communication and computing resource allocation, dubbed CCRA, including VNF placement and assignment, traffic prioritization, and path selection considering capacity constraints as well as link and queuing delays, with the goal of minimizing overall cost. We formulate the problem as a non-linear programming model, and propose two approaches, dubbed B&B-CCRA and WF-CCRA respectively, based on the Branch & Bound and Water-Filling algorithms. Numerical simulations show that B&B-CCRA can solve the problem optimally, whereas WF-CCRA can provide near-optimal solutions in significantly less time.
面向延迟敏感型B5G的近最优云-网络集成资源分配
如今,随着对容量的需求不断扩大,万物互联的蓬勃发展带来了对通信网络的新认知的范式转变,带来了大量完全独特的服务。为了提供这些服务,终端用户必须建立并访问虚拟网络功能(VNFs),这将生成和消耗大量数据,这些数据必须在本地处理,以实现服务响应性和可伸缩性。要实现这一目标,必须有坚实的云-网络一体化基础设施,云域和网络域特征多样,能力有限,需要共同控制通信和计算资源,充分发挥其潜力。虽然已经提出了几种创新的资源分配方法,但大多数方法要么忽略网络资源,要么将网络放松为一个简单的图,由于其动态性和严格的QoS要求,这些方法并不适用于超越5G。本文通过研究通信和计算资源分配的联合问题(CCRA)来填补这一空白,该问题包括VNF的放置和分配、流量优先级以及考虑容量约束以及链路和排队延迟的路径选择,目标是使总成本最小化。我们将问题表述为一个非线性规划模型,并提出了两种方法,分别称为B&B-CCRA和WF-CCRA,基于分支定界和注水算法。数值模拟结果表明,B&B-CCRA算法可以最优地解决问题,而WF-CCRA算法可以在更短的时间内提供接近最优的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信