基于改进式贪婪算法的5G网络切片动态资源调度策略  

Dynamic resource scheduling strategy for 5G network slicing based on improved greedy algorithm

作　　者：陈强 刘彩霞[1,2] 李凌书 CHEN Qiang;LIU Caixia;LI Lingshu(National Digital Switching System Engineering and Technological R＆D Center,Zhengzhou 450002,China;National Engineering Laboratory for Mobile Network Security,Beijing 100876,China)

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]移动互联网安全技术国家工程实验室,北京100876

出　　处：《网络与信息安全学报》2018年第7期60-68,共9页Chinese Journal of Network and Information Security

基　　金：国家高技术研究发展计划("863"计划)基金资助项目(No.2014AA01A701);国家自然科学基金资助项目(No.61521003);科技部支撑计划基金资助项目(No.2014BAH30B01)~~

摘　　要：为了解决移动通信网络中资源利用率和用户体验质量的瓶颈问题,5G引入网络切片来应对用户的巨大资源需求。提出了一种基于改进式贪婪算法的网络切片动态资源调度策略,在切片调度和用户调度阶段,设计了一种两层模型,即切片-用户模型,并且结合改进式贪婪算法,使服务权重值最大的切片和优先级最高的用户组合,完成相应的服务。该方法是将全局资源最优问题简化为规模更小的子问题,通过每一次切片和用户的最佳组合,从而使整个系统的资源和用户的体验质量达到最优。Matlab的仿真结果表明,基于改进式贪婪算法的网络切片动态资源调度策略在系统剩余资源利用率、系统达到平均的Qo E水平、系统吞吐量等方面都显优于现行的资源调度策略,能够更好地满足用户的需求。Dealing with the problem of network resource utilization and the user experience, the network slicing as a novel technology is adopted in 5 G. A dynamic resource scheduling strategy for 5 G network slicing based on improved greedy algorithm was proposed. In the process of slice scheduling and user scheduling, a two layer slice-user model combined with the improved greedy algorithm was proposed, which ensured the slices with maximum service weight and the highest priority users combined together to complete corresponding services. The global resource optimal problem was transformed into a smaller sub problem by means of the optimal combination of each slice and every user, which improved the network resource utilization and the user experience in the meantime. The Matlab simulation results show that compared with existing algorithms, the proposed method could effective improve the system remaining resource utilization, system average Qo E level and system throughput.

关 键 词：网络切片 切片权重值 用户优先级 动态资源调度 改进式贪婪算法 

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