Resource allocation for coexistence of eMBB and bursty URLLC based on queueing with preemption

Wei Guo , Kai Liang , Yuewen Song , Xiaoli Chu , Gan Zheng , Kai-Kit Wong
{"title":"Resource allocation for coexistence of eMBB and bursty URLLC based on queueing with preemption","authors":"Wei Guo ,&nbsp;Kai Liang ,&nbsp;Yuewen Song ,&nbsp;Xiaoli Chu ,&nbsp;Gan Zheng ,&nbsp;Kai-Kit Wong","doi":"10.1016/j.jiixd.2025.03.003","DOIUrl":null,"url":null,"abstract":"<div><div>Enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) are two critical services in 5G mobile networks. While there has been extensive research on their coexistence, few studies have considered the impact of bursty URLLC on their coexistence performance. In this paper, we propose a method to allocate computing and radio resources for coexisting eMBB and bursty URLLC services by preempting both computing queues in the base station (BS) and time-frequency resources at the air interface. Specifically, we first divide the computing resources at the BS into a shared part for both URLLC and eMBB users and an exclusive part only for eMBB users, and propose a queuing mechanism with preemptive-resume priority for accessing the shared computing resources. Furthermore, we propose a preemptive puncturing method and a threshold-based queuing mechanism in the air interface to enable the multiplexing of eMBB and URLLC on shared time-frequency resources. We analytically derive the average queuing delay, average computation delay, and average transmission delay of eMBB and URLLC packets. Based on this analysis, we formulate a mixed-integer nonlinear programming problem to minimize the average delay of URLLC packets while satisfying the average delay and throughput requirements of eMBB by jointly optimizing the eMBB subcarrier allocation, the URLLC subcarrier scheduling and the computing resource allocation. We decompose this problem into three sub-problems and solve them alternately using a block coordinate descent algorithm. Numerical results show that our proposed method reduces the outage probability and average delay of URLLC compared to the existing works.</div></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"3 3","pages":"Pages 223-241"},"PeriodicalIF":0.0000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information and Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949715925000113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) are two critical services in 5G mobile networks. While there has been extensive research on their coexistence, few studies have considered the impact of bursty URLLC on their coexistence performance. In this paper, we propose a method to allocate computing and radio resources for coexisting eMBB and bursty URLLC services by preempting both computing queues in the base station (BS) and time-frequency resources at the air interface. Specifically, we first divide the computing resources at the BS into a shared part for both URLLC and eMBB users and an exclusive part only for eMBB users, and propose a queuing mechanism with preemptive-resume priority for accessing the shared computing resources. Furthermore, we propose a preemptive puncturing method and a threshold-based queuing mechanism in the air interface to enable the multiplexing of eMBB and URLLC on shared time-frequency resources. We analytically derive the average queuing delay, average computation delay, and average transmission delay of eMBB and URLLC packets. Based on this analysis, we formulate a mixed-integer nonlinear programming problem to minimize the average delay of URLLC packets while satisfying the average delay and throughput requirements of eMBB by jointly optimizing the eMBB subcarrier allocation, the URLLC subcarrier scheduling and the computing resource allocation. We decompose this problem into three sub-problems and solve them alternately using a block coordinate descent algorithm. Numerical results show that our proposed method reduces the outage probability and average delay of URLLC compared to the existing works.
基于抢占排队的eMBB和突发URLLC共存资源分配
增强型移动宽带(eMBB)和超可靠低延迟通信(URLLC)是5G移动网络中的两项关键业务。虽然对它们的共存进行了大量的研究,但很少有研究考虑突发URLLC对它们共存性能的影响。本文提出了一种通过抢占基站(BS)的计算队列和空中接口的时频资源,为同时存在的eMBB和突发URLLC业务分配计算和无线电资源的方法。具体而言,我们首先将BS的计算资源划分为URLLC和eMBB用户共享的部分和eMBB用户独占的部分,并提出了一种具有抢占-恢复优先级的访问共享计算资源的排队机制。此外,我们提出了一种先发制人的穿刺方法和基于阈值的空中接口排队机制,以实现eMBB和URLLC在共享时频资源上的复用。分析了eMBB和URLLC包的平均排队延迟、平均计算延迟和平均传输延迟。在此基础上,通过对eMBB子载波分配、URLLC子载波调度和计算资源分配进行联合优化,提出了在满足eMBB平均时延和吞吐量要求的同时最小化URLLC数据包平均时延的混合整数非线性规划问题。我们将该问题分解为三个子问题,并使用块坐标下降算法交替求解。数值计算结果表明,与现有工程相比,该方法降低了URLLC的中断概率和平均延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信