魏延南1,,,
谭颀1,
唐睿2,
陈前斌1
1.重庆邮电大学通信与信息工程学院移动通信技术重点实验室 重庆 400065
2.重庆大学光电工程学院 重庆 400044
基金项目:国家自然科学基金(61571073)，重庆市教委科学技术研究项目(KJZD-M201800601)
详细信息
作者简介:唐伦：男，1973年生，教授，研究方向为下一代无线通信网络、异构蜂窝网络、软件定义无线网络等
魏延南：男，1995年生，硕士生，研究方向为5G网络切片、虚拟资源分配、随机优化理论
谭颀：女，1995年生，硕士生，研究方向为5G网络切片、资源分配、随机优化理论
陈前斌：男，1967年生，教授，博士生导师，研究方向为个人通信、多媒体信息处理与传输、异构蜂窝网络等
通讯作者:魏延南 weiyannan_cqupt@163.com
中图分类号:TN929.5计量
文章访问数:1837
HTML全文浏览量:522
PDF下载量:53
被引次数:0
出版历程
收稿日期:2019-06-17
修回日期:2020-01-03
网络出版日期:2020-01-11
刊出日期:2020-06-04
Joint Congestion Control and Resource Allocation Dynamic Scheduling Strategy for Network Slices in Heterogeneous Cloud Raido Access Network
Lun TANG1,Yannan WEI1,,,
Qi TAN1,
Rui TANG2,
Qianbin CHEN1
1. Key Laboratory of Mobile Communication Technology, School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2. School of Measurement and Control Technology and Instruments, Chongqing University, Chongqing 400044, China
Funds:The National Natural Science Foundation of China (61571073), The Science and Technology Research Program of Chongqing Municipal Education Commission (KJZD-M201800601)
摘要
摘要:针对异构云无线接入网络(H-CRAN)网络下基于网络切片的在线无线资源动态优化问题，该文通过综合考虑业务接入控制、拥塞控制、资源分配和复用，建立一个以最大化网络平均和吞吐量为目标，受限于基站(BS)发射功率、系统稳定性、不同切片的服务质量(QoS)需求和资源分配等约束的随机优化模型，并进而提出了一种联合拥塞控制和资源分配的网络切片动态资源调度算法。该算法会在每个资源调度时隙内动态地为性能需求各异的网络切片中的用户分配资源。仿真结果表明，该文算法能在满足各切片用户QoS需求和维持网络稳定的基础上，提升网络整体吞吐量，并且还可通过调整控制参量的取值实现时延和吞吐量间的动态平衡。
关键词:异构云无线接入网络/
网络切片/
资源分配/
李雅普诺夫随机优化
Abstract:For online dynamic radio resources optimization for network slices in Heterogeneous Cloud Raido Access Network(H-CRAN), by comprehensively considering traffic admission control, congestion control, resource allocation and reuse, the problem is formulated as a stochastic optimization programming which maximizes network average total throughput subject to Base Station (BS) transmit power, system stability, Quality of Service (QoS) requirements of different slices and resource allocation constraints. Then, a joint congestion control and resource allocation dynamic scheduling algorithm is proposed which will dynamically allocate resources to users in network slices with distinct performance requirements within each resource scheduling time slot. The simulation results show that the proposed algorithm can improve the network overall throughput while satisfying the QoS requirement of each slice user and maintaining network stability. Besides, it could also flexibly strike a dynamic balance between delay and throughput by simply tuning an introduced control parameter.
Key words:Heterogeneous Cloud Raido Access Network (H-CRAN)/
Network Slice (NS)/
Resource allocation/
Lyapunov stochastic optimization
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=a093c09e-a1b2-4d03-893e-6b64c25c12c5
