一种基于网络切片的带宽资源编排算法  

A Bandwidth Resource Orchestration Algorithm Based on Network Slicing

作　　者：龙恳[1] 钱美伶 余翔[1] 陈侃 LONG Ken;QIAN Meiling;YU Xiang;CHEN Kan(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院

出　　处：《计算机工程》2019年第10期78-83,共6页Computer Engineering

基　　金：国家科技重大专项(2017ZX03001004-004)

摘　　要：为在无线虚拟化环境下进行高效的带宽资源分配,研究基于增强型移动宽带(eMBB)与高可靠低时延通信(uRLLC)的带宽资源编排问题。对于小型网络,将带宽资源编排问题简化为带宽资源分配问题并给出全局最优解。针对大型网络,结合松弛理论将带宽资源编排问题转化为带宽资源编排的松弛问题,并提出一种基于贪婪理论的启发式算法HPGH。仿真结果表明,通过解决带宽资源编排问题,可以按需为用户动态分配带宽资源,且HPGH算法能够有效提升eMBB业务的吞吐量,降低uRLLC业务的最大传输时延。In order to allocate bandwidth resources efficiently in wireless virtualization environment,the bandwidth resource orchestration problem based on enhanced Mobile Broadband(eMBB)and ultra Reliable Low Latency Communication(uRLLC)is studied.For small-scale networks,the problem of bandwidth resource orchestration is simplified to the problem of bandwidth resource allocation and the global optimal solution is given.For large-scale networks,the bandwidth resource orchestration problem is transformed into the bandwidth resource orchestration relaxation problem based on the relaxation theory,and a heuristic algorithm HPGH based on the greedy theory is proposed.Simulation results show that by solving the problem of bandwidth resource orchestration,bandwidth resources can be dynamically allocated to users on demand,and the HPGH algorithm can effectively improve the throughput of eMBB services and reduce the maximum transmission delay of uRLLC services.

关 键 词：网络切片 增强型移动宽带 高可靠低时延通信 带宽资源编排 松弛理论 启发式算法 

分 类 号：TN929.5[电子电信—通信与信息系统]