Chinese Journal of Network and Information Security ›› 2018, Vol. 4 ›› Issue (7): 60-68.doi: 10.11959/j.issn.2096-109x.2018057

• Papers • Previous Articles     Next Articles

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

Qiang CHEN1,2,Caixia LIU1,2,Lingshu LI1,2   

  1. 1 National Digital Switching System Engineering and Technological R&D Center,Zhengzhou 450002,China
    2 National Engineering Laboratory for Mobile Network Security,Beijing 100876,China
  • Revised:2018-06-28 Online:2018-07-01 Published:2018-09-10
  • Supported by:
    The National High Technology Research and Development Program of China (863 Program)(2014AA01A701);The National Natural Science Foundation of China(61521003);Ministry of Science and Technology Support Plan(2014BAH30B01)


Dealing with the problem of network resource utilization and the user experience,the network slicing as a novel technology is adopted in 5G.A dynamic resource scheduling strategy for 5G 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 QoE level and system throughput.

Key words: network slicing, slicing weight value, user priority, dynamic resource scheduling, improved greedy algorithm

CLC Number: 

No Suggested Reading articles found!