通信学报 ›› 2022, Vol. 43 ›› Issue (11): 213-224.doi: 10.11959/j.issn.1000-436x.2022207

• 学术通信 • 上一篇    下一篇

面向B5G多业务场景基于D3QN的双时间尺度网络切片算法

陈赓1, 齐书虎1, 沈斐2, 曾庆田1   

  1. 1 山东科技大学电子信息工程学院,山东 青岛 266590
    2 中国科学院上海微系统与信息技术研究所,上海 200050
  • 修回日期:2022-10-18 出版日期:2022-11-25 发布日期:2022-11-01
  • 作者简介:陈赓(1984− ),男,山东潍坊人,博士,山东科技大学副教授、硕士生导师,主要研究方向为异构网络、泛在网络和软件定义移动网络、无线资源管理和优化算法
    齐书虎(1998− ),男,山东聊城人,山东科技大学硕士生,主要研究方向为网络切片、资源分配
    沈斐(1983− ),女,江苏南京人,博士,中国科学院上海微系统与信息技术研究所研究员、博士生导师,主要研究方向为无线通信、边缘计算和雾计算的资源优化
    曾庆田(1976− ),男,山东潍坊人,博士,山东科技大学教授、博士生导师,主要研究方向为Petri网、过程挖掘和知识管理
  • 基金资助:
    国家自然科学基金资助项目(61701284);国家自然科学基金资助项目(61871370);国家重点研发计划基金资助项目(2019YFE0120700);国家重点研发计划基金资助项目(2019YFB1803101);山东省自然科学基金资助项目(ZR2022MF226);青岛市应用基础研究计划基金资助项目(19-6-2-1-cg);山东科技大学菁英计划基金资助项目(skr21-3-B-048);中国科学院百人计划基金资助项目(E06BRA1001);山东省泰山学者计划基金资助项目(ts20190936);山东省高校青年创新团队科技支撑计划基金资助项目(2019KJN024)

Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios

Geng CHEN1, Shuhu QI1, Fei SHEN2, Qingtian ZENG1   

  1. 1 College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China
    2 Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China
  • Revised:2022-10-18 Online:2022-11-25 Published:2022-11-01
  • Supported by:
    The National Natural Science Foundation of China(61701284);The National Natural Science Foundation of China(61871370);The National Key Research and Development Program of China(2019YFE0120700);The National Key Research and Development Program of China(2019YFB1803101);The Natural Science Foundation of Shandong Province(ZR2022MF226);The Innovative Research Foundation of Qingdao(19-6-2-1-cg);The Elite Plan Project of Shandong University of Science and Technology(skr21-3-B-048);The Hundred Talent Program of Chinese Academy of Sciences(E06BRA1001);The Taishan Scholar Program of Shandong Province(ts20190936);The Science and Technology Support Plan of Youth Innovation Team of Shandong Higher School(2019KJN024)

摘要:

为了有效满足不同切片的差异化服务质量需求,面向B5G多业务场景提出了一种基于竞争双深度Q网络(D3QN)的双时间尺度网络切片算法。研究了联合资源切片和调度问题,以归一化处理后的频谱效率和不同切片用户服务质量指数的加权和作为优化目标。在大时间尺度内,SDN控制器根据每种业务的资源需求利用D3QN算法预先分配给不同的切片,然后根据基站负载状态执行基站级资源更新。在小时间尺度内,基站通过轮询调度算法将资源调度到终端用户。仿真结果表明,所提算法在保证切片用户服务质量需求、频谱效率和系统效用方面具有优异的性能。与其他4种基准算法相比,所提算法的系统效用分别提升了3.22%、3.81%、7.48%和21.14%。

关键词: 双时间尺度, 资源分配, 网络切片, 竞争双深度Q网络, 系统效用

Abstract:

To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively.

Key words: dual time scale, resource allocation, network slicing, dueling double DQN, system utility

中图分类号: 

No Suggested Reading articles found!