通信学报 ›› 2022, Vol. 43 ›› Issue (9): 148-156.doi: 10.11959/j.issn.1000-436x.2022177

• 学术论文 • 上一篇    下一篇

基于细粒度切片的6G网络弹性切换算法研究

朱晓荣, 陈康   

  1. 南京邮电大学江苏省无线通信重点实验室,江苏 南京 210003
  • 修回日期:2022-08-29 出版日期:2022-09-25 发布日期:2022-09-01
  • 作者简介:朱晓荣(1977- ),女,山东临沂人,南京邮电大学教授、博士生导师,主要研究方向为 5G/6G 通信系统、物联网、区块链等关键技术及系统研发
    陈康(1998- ),男,山东枣庄人,南京邮电大学硕士生,主要研究方向为无线通信、接入网切片技术等
  • 基金资助:
    国家自然科学基金资助项目(61871237);国家自然科学基金资助项目(92067101);江苏省高校“青蓝工程”基金资助项目;江苏省重点研发计划基金资助项目(BE2021013-3);江苏省研究生科研与实践创新计划基金资助项目(KYCX21_0733)

Research on elastic handover algorithm of 6G network based on fine-grained slicing

Xiaorong ZHU, Kang CHEN   

  1. Jiangsu Key Laboratory of Wireless Communications, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • Revised:2022-08-29 Online:2022-09-25 Published:2022-09-01
  • Supported by:
    The National Natural Science Foundation of China(61871237);The National Natural Science Foundation of China(92067101);Program to Cultivate Middle-aged and Young Science Leaders of Universities of Jiangsu Province;The Key Research and Development Program of Jiangsu Province(BE2021013-3);Jiangsu Province Postgraduate Research and Practice Innovation Program(KYCX21_0733)

摘要:

面向未来全息通信、增强扩展现实等业务的涌现,需要将大带宽业务按照用户速率需求划分为更细粒度的业务切片实现多样化的业务。针对大带宽业务细粒度切片的网络切换问题,提出了基于二分图匹配的6G网络弹性切换算法,通过完成“用户-切片-基站”的最优关联,最大化用户和速率,并将接入问题建模为层次化二分图稳定匹配问题,通过“切片-基站”一体化和“先切片再基站”两阶段的2种匹配思想,使用Gale-Shapley 匹配算法,实现网络的自适应切换。仿真结果表明,所提的一体化和两阶段匹配算法的接入成功率与传统方法相比分别提升15%和10%,用户和速率也有明显提升。

关键词: 网络切换, 细粒度切片, 弹性匹配, 资源分配

Abstract:

With the emergence of high-bandwidth services such as holographic communication and augmented reality in the future, high-bandwidth services will be divided into finer-grained service slices according to the rates to meet diverse requirements of users.For the problem of how to complete network switching in a fine-grained slicing of large bandwidth services, an elastic handover algorithm of 6G network based on bipartite graph stable matching was proposed.By optimizing “user-network slice-base station” association, the total rate of users was maximized, and the access problem was modeled as a hierarchical bipartite graph stable matching problem.Then by using the two matching ideas of “slice base station” integration and “slice first and then base station”, the adaptive handoff of the network was realized by using Gale-Shapley algorithm.Simulation results show that the access success rates of the proposed integrated and two-stage matching algorithms are 15% and 10% higher respectively than that of the traditional method, and the total rate of users is also significantly improved.

Key words: network handover, fine-grained slicing, elastic matching, resource allocation

中图分类号: 

No Suggested Reading articles found!