Journal on Communications ›› 2022, Vol. 43 ›› Issue (11): 213-224.doi: 10.11959/j.issn.1000-436x.2022207

• Correspondences • Previous Articles     Next Articles

Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios

Geng CHEN1, Shuhu QI1, Fei SHEN2, Qingtian ZENG1   

  1. 1 College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China
    2 Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China
  • Revised:2022-10-18 Online:2022-11-25 Published:2022-11-01
  • Supported by:
    The National Natural Science Foundation of China(61701284);The National Natural Science Foundation of China(61871370);The National Key Research and Development Program of China(2019YFE0120700);The National Key Research and Development Program of China(2019YFB1803101);The Natural Science Foundation of Shandong Province(ZR2022MF226);The Innovative Research Foundation of Qingdao(19-6-2-1-cg);The Elite Plan Project of Shandong University of Science and Technology(skr21-3-B-048);The Hundred Talent Program of Chinese Academy of Sciences(E06BRA1001);The Taishan Scholar Program of Shandong Province(ts20190936);The Science and Technology Support Plan of Youth Innovation Team of Shandong Higher School(2019KJN024)

Abstract:

To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively.

Key words: dual time scale, resource allocation, network slicing, dueling double DQN, system utility

CLC Number: 

No Suggested Reading articles found!