A Two-Layer Closed-loop Cooperative Resource Allocation Framework for Improving QoS of MEC Network Slicing
-
摘要: 在5G/6G驱动的多接入边缘计算(MEC)环境中,提高资源利用率的同时,确保异构网络切片的服务质量(QoS)具有重要意义。然而,当前方法在异构环境下缺乏动态适应性,无法协同优化缓存、带宽和计算资源,存在资源利用率下降、服务成功率下降等问题。本文首先形式化定义了网络切片资源分配问题,并通过将多维0-1背包问题归约到该问题来证明其是NP-难问题。然后提出了一种具有缓存感知的双层闭环协同资源分配框架,上层构建一种群体协同的全局搜索机制,通过候选解演化、历史最优引导与自适应参数调整,在复杂约束条件下生成高质量资源候选分配方案,下层构建一个多维权重评估模型以准确将低延迟、高带宽的服务需求指标转化为QoS约束,通过上下双层闭环协同实现缓存、带宽和计算资源的联合优化,进而改善了异构网络切片的QoS。大量实验表明,与基线方法相比,所提方法使资源利用率提升了2.29%到24.50%,用户评分提升了4.13%到59.34%,为异构MEC环境提供了一种鲁棒的资源分配解决方案。Abstract:
Objective Driven by 5G/6G networks, the Multi-access Edge Computing (MEC) environment faces significant challenges in ensuring Quality of Service (QoS) for heterogeneous network slices while improving resource utilization. Current resource allocation methods often lack dynamic adaptability in heterogeneous settings and fail to co-optimize caching, bandwidth, and computing resources. This leads to issues such as declining resource utilization and reduced service success rates. The work in this paper aims to address these limitations by proposing a robust framework for jointly optimizing multi-dimensional resources under strict QoS constraints, thereby providing a tailored solution for heterogeneous MEC environments. Methods This paper first formally defines the network slicing resource allocation problem. By reducing the NP-hard multi-dimensional 0-1 knapsack problem to this problem, its NP-hardness is theoretically proven. To address this complex optimization problem, a cache-aware dual-layer closed-loop collaborative framework named QCache is proposed. The framework operates through a synergistic "generate-evaluate-feedback" loop. In the upper Global Exploration Layer, a hybrid heuristic algorithm combining a population evolution strategy (with selection, crossover, and mutation) and a particle update mechanism (guided by historical individual and global best positions) is designed. This layer performs broad exploration of the solution space to generate high-quality candidate resource allocation schemes under complex constraints, featuring adaptive parameter adjustment and elite retention strategies to avoid local optima. In the lower Multi-dimensional Weight Evaluation Layer, a quantitative assessment model is constructed. This model accurately translates low-latency and high-bandwidth service demands into explicit QoS constraints by normalizing key performance indicators (e.g., delay, rate) and dynamically weighting them using the entropy weight method, reflecting different slice priorities. The evaluated score (SCORE) from this layer is fed back to the upper layer as a fitness value, guiding the iterative evolution of candidate solutions until convergence. Results and Discussions Extensive simulations are conducted to validate the effectiveness of the proposed QCache framework against several baseline methods, including GA, PSO, GraphSAGE, and a No-Consideration-of-Service-Quality (NCSQ) scheme. Under identical resource and user demand scenarios, the overall comparative analysis ( Fig.3 ) demonstrates that QCache achieves the highest resource utilization rate of 80.30% and the best average service score of 1.109. Compared to the baseline methods, QCache improves resource utilization by 2.29% to 24.50% and enhances user service scores by 4.13% to 59.34%. Experiments under varying total cache resources (Fig.4 ) show that QCache maintains superior performance, improving utilization by 2.43% to 27.53% and service scores by 10.81% to 119.56% across different cache states, validating its cache-aware adaptability. Tests with increasing total user numbers (Fig.5 ) reveal that QCache scales effectively, achieving up to 85.83% resource utilization and a 3.06 service score, demonstrating its capability to handle dense access scenarios. Furthermore, experiments simulating time-varying user demands (Fig.6 ) confirm the framework's dynamic robustness, where QCache achieves an average improvement of 9.20% in resource utilization and 23.45% in service score over baselines.Conclusions This paper addresses the NP-hard resource allocation problem in dynamic MEC environments with heterogeneous network slices. The proposed cache-aware two-level closed-loop cooperative framework, QCache, successfully achieves joint optimization of caching, communication, and computing resources under explicit QoS constraints. The upper-layer hybrid heuristic provides powerful global search capabilities, while the lower-layer multi-dimensional weight model ensures accurate QoS quantification and dynamic feedback. Comprehensive experimental results demonstrate that QCache significantly outperforms existing methods in both resource utilization efficiency and user QoS satisfaction. In future work, integrating reinforcement learning and traffic prediction mechanisms will be explored to further enhance the framework's responsiveness to bursty traffic and anomalous demands, promoting more intelligent and autonomous evolution of MEC network slice resource management. -
Key words:
- Multi-access Edge Computing /
- Network Slicing /
- Resource Allocation /
- QoS Guarantee
-
1 缓存资源分配计算算法
输入:用户需求集REQ,基站缓存集CACHE,切片资源配置集
SLICE;输出:基站缓存资源最优分配集UPDATE。 ① 使用随机资源分配策略初始化种群$ pop $,初始化种群
$ fitness $、个体最优$ pbest $和种群最优$ gbest $的适应度以及基站的
缓存策略$ UPDATE $;② for 种群的每次迭代 do ③ 基于多维权重模型计算个体的$ fitness $; ④ 更新$ pbest $和$ gbest $; ⑤ 基于$ fitness $从大到小对$ pop $进行排序; ⑥ 选择$ pop $小于精英比例的部分为$ pop1 $,其余部分为$ pop2 $; ⑦ 对$ pop1 $执行锦标赛选择、单点交叉和高斯变异操作,对
$ pop2 $执行更新位置和速度操作;⑧ end for ⑨ 基于多维权重模型计算每个个体$ fitness $; ⑩ 输出缓存分配最适合的策略$ UPDATE $。 2 多维度权重评估计算算法
输入:用户需求UREQ,用户与基站的距离DIS,用户数据包
PACK,基站缓存状态STATE,切片给用户分配的资源配置集
RES;输出:用户的综合评分SCORE。 ① 根据公式(4)计算$ SINR $,根据公式(7)和(8)计算$ rate $,根据
公式(11)计算$ delay $;② if 所需数据没有在基站中缓存 ③ delay需根据公式(14)加上额外的时延; ④ end if ⑤ 归一化速率$ rate $和时延$ delay $等属性; ⑥ 计算各属性的信息熵; ⑦ 计算各属性的冗余度; ⑧ 输出每个指标加权后的分数SCORE。 -
[1] ZHUANSUN Chenlu, LI Pengdeng, LIU Yuan, et al. Generative AI-assisted mobile-edge computation offloading in digital-twin-enabled IIoT[J]. IEEE Internet of Things Journal, 2025, 12(10): 13248–13258. doi: 10.1109/JIOT.2025.3547370. [2] ZOU Haodong, GUO Jianxiong, SUN Suping, et al. Adaptive image batching and slicing in edge networks for delay-critical small object detection[J]. IEEE Transactions on Parallel and Distributed Systems, 2026, 37(7): 1657–1670. doi: 10.1109/TPDS.2026.3694562. [3] MALEKI E F, MA Weibin, MASHAYEKHY L, et al. QoS-aware content delivery in 5G-enabled edge computing: Learning-based approaches[J]. IEEE Transactions on Mobile Computing, 2024, 23(10): 9324–9336. doi: 10.1109/TMC.2024.3363143. [4] WANG Tian, LIANG Yuzhu, SHEN Xuewei, et al. Edge computing and sensor-cloud: Overview, solutions, and directions[J]. ACM Computing Surveys, 2023, 55(13s): 1–37. doi: 10.1145/3582270. [5] 林粤伟, 张奇勋, 尉志青, 等. 通信感知一体化硬件设计——现状与展望[J]. 电子与信息学报, 2025, 47(1): 1–21. doi: 10.11999/JEIT240012.LIN Yuewei, ZHANG Qixun, WEI Zhiqing, et al. Status and prospect of hardware design on integrated sensing and communication[J]. Journal of Electronics & Information Technology, 2025, 47(1): 1–21. doi: 10.11999/JEIT240012. [6] LIANG Yuzhu, YIN Mujun, WANG Wenhua, et al. Collaborative edge server placement for maximizing QoS with distributed data cleaning[J]. IEEE Transactions on Services Computing, 2025, 18(3): 1321–1335. doi: 10.1109/TSC.2025.3552337. [7] YANG Hui, YU Ao, ZHANG Jie, et al. Data-driven network slicing from core to RAN for 5G broadcasting services[J]. IEEE Transactions on Broadcasting, 2021, 67(1): 23–32. doi: 10.1109/TBC.2020.3031742. [8] HAMDI W, KSOURI C, BULUT H, et al. Network slicing-based learning techniques for IoV in 5G and beyond networks[J]. IEEE Communications Surveys & Tutorials, 2024, 26(3): 1989–2047. doi: 10.1109/COMST.2024.3372083. [9] WANG Tian, LIANG Yuzhu, JIA Weijia, et al. Coupling resource management based on fog computing in smart city systems[J]. Journal of Network and Computer Applications, 2019, 135: 11–19. doi: 10.1016/j.jnca.2019.02.021. [10] 徐冬竹, 周安福, 马华东, 等. 基于连续学习的视频物联网任务需求理解与调度方法[J]. 计算机研究与发展, 2024, 61(11): 2793–2805. doi: 10.7544/ISSN1000-1239.202440403.XU Dongzhu, ZHOU Anfu, MA Huadong, et al. Continuous learning-based task demand understanding and scheduling method for video internet of things[J]. Journal of Computer Research and Development, 2024, 61(11): 2793–2805. doi: 10.7544/ISSN1000-1239.202440403. [11] LIANG Yuzhu, XU Changfu, MEI Yaxin, et al. A comprehensive survey on large language model compression for artificial intelligence applications in edge systems[J]. IEEE Internet of Things Journal, 2026, 13(10): 20583–20599. doi: 10.1109/JIOT.2026.3675866. [12] European Telecommunications Standards Institute. ETSI GS MEC 003 V2.1. 1 (2019-01) Multi-access edge computing (MEC); framework and reference architecture[S]. Alpes Maritimes: ETSI, 2019. [13] YUE Yi, CHENG Bo, SUN Shiding, et al. Availability guaranteed and resource efficient VNF placement in SDN/NFV-Enabled network through traffic forecasting[C]. 2025 IEEE International Conference on Web Services, Helsinki, Finland, 2025: 983–992. doi: 10.1109/ICWS67624.2025.00139. [14] MAHDI S S and ABDULLAH A A. Survey on enabling network slicing based on SDN/NFV[C]. International Conference on Information Systems and Intelligent Applications, ICISIA 2022, Cham, Germany, 2022: 733–758. doi: 10.1007/978-3-031-16865-9_59. [15] SINDJOUNG M L F, VELEMPINI M, and BOMGNI A B. A MEC architecture for a better quality of service in an Autonomous Vehicular Network[J]. Computer Networks, 2022, 219: 109454. doi: 10.1016/j.comnet.2022.109454. [16] ZHANG Zhengming, HUANG Yongming, ZHANG Cheng, et al. Digital twin-enhanced deep reinforcement learning for resource management in networks slicing[J]. IEEE Transactions on Communications, 2024, 72(10): 6209–6224. doi: 10.1109/TCOMM.2024.3395698. [17] FAN Wenhao, LI Xuewei, TANG Bihua, et al. MEC network slicing: Stackelberg-game-based slice pricing and resource allocation with QoS guarantee[J]. IEEE Transactions on Network and Service Management, 2024, 21(4): 4494–4509. doi: 10.1109/TNSM.2024.3409277. [18] LIANG Yuzhu, YIN Mujun, ZHANG Yilin, et al. Grouping reduces energy cost in directionally rechargeable wireless vehicular and sensor networks[J]. IEEE Transactions on Vehicular Technology, 2023, 72(8): 10840–10851. doi: 10.1109/TVT.2023.3259683. [19] WANG Shuai and ZHOU Aimin. Leader prediction for multiobjective particle swarm optimization[J]. IEEE Transactions on Evolutionary Computation, 2025, 29(4): 1356–1370. doi: 10.1109/TEVC.2024.3417978. [20] HWANG J, NKENYEREYE L, SUNG N, et al. IoT service slicing and task offloading for edge computing[J]. IEEE Internet of Things Journal, 2021, 8(14): 11526–11547. doi: 10.1109/JIOT.2021.3052498. [21] ZHANG Tiankui, WANG Yi, YI Wenqiang, et al. Joint optimization of caching placement and trajectory for UAV-D2D networks[J]. IEEE Transactions on Communications, 2022, 70(8): 5514–5527. doi: 10.1109/TCOMM.2022.3182033. [22] LIU Xing, LV Jianhui, KIM B G, et al. Cooperative digital healthcare task scheduling and resource management in edge intelligence systems[J]. Tsinghua Science and Technology, 2025, 30(2): 926–945. doi: 10.26599/TST.2024.9010140. [23] HELMY M, ABDELLATIF A A, MHAISEN N, et al. Slicing for AI: An online learning framework for network slicing supporting AI services[J]. IEEE Transactions on Network and Service Management, 2025, 22(6): 5239–5254. doi: 10.1109/TNSM2025.3603391. [24] NASSAR A and YILMAZ Y. Deep reinforcement learning for adaptive network slicing in 5G for intelligent vehicular systems and smart cities[J]. IEEE Internet of Things Journal, 2022, 9(1): 222–235. doi: 10.1109/JIOT.2021.3091674. [25] QIAO Kai, WANG Hongchao, ZHANG Weiting, et al. Resource allocation for network slicing in open RAN: A hierarchical learning approach[J]. IEEE Transactions on Cognitive Communications and Networking, 2025, 11(4): 2584–2600. doi: 10.1109/TCCN.2024.3524641. [26] PEREIRA P M R, DE BAIRROS T A M, DE SOUZA R A A, et al. Mobility, path loss, and composite fading: Performance of a conventional and of a non-conventional system with a robust autoencoder[J]. IEEE Transactions on Vehicular Technology, 2023, 72(12): 16725–16730. doi: 10.1109/TVT.2023.3294756. [27] ANGELELLI E, MANSINI R, and SPERANZA M G. Kernel search: A general heuristic for the multi-dimensional knapsack problem[J]. Computers & Operations Research, 2010, 37(11): 2017–2026. doi: 10.1016/j.cor.2010.02.002. [28] LIU Tao, JIANG Aimin, ZHOU Jia, et al. GraphSAGE-based dynamic spatial-temporal graph convolutional network for traffic prediction[J]. IEEE Transactions on Intelligent Transportation Systems, 2023, 24(10): 11210–11224. doi: 10.1109/TITS.2023.3279929. [29] WANG Zhaoying, WEI Yifei, YU F R, et al. Utility optimization for resource allocation in multi-access edge network slicing: A twin-actor deep deterministic policy gradient approach[J]. IEEE Transactions on Wireless Communications, 2022, 21(8): 5842–5856. doi: 10.1109/TWC.2022.3143949. -
下载:
下载: