Flexible Resource Block Allocation to Multiple Slices for Radio Access Network Slicing Using Deep Reinforcement Learning

被引:66
作者
Abiko, Yu [1 ]
Saito, Takato [2 ]
Ikeda, Daizo [2 ]
Ohta, Ken [2 ]
Mizuno, Tadanori [3 ]
Mineno, Hiroshi [1 ]
机构
[1] Shizuoka Univ, Grad Sch Integrated Sci & Technol, Hamamatsu, Shizuoka 4328011, Japan
[2] NTT DOCOMO Inc, Res Labs, Yokosuka, Kanagawa 2398536, Japan
[3] Aichi Inst Technol, Fac Informat Sci, Toyota 4700356, Japan
基金
日本学术振兴会;
关键词
Resource management; 5G mobile communication; Radio access networks; Machine learning; Scalability; Network slicing; Deep reinforcement learning; network slicing; RAN slicing; resource management; 5G;
D O I
10.1109/ACCESS.2020.2986050
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the fifth-generation of mobile communications, network slicing is used to provide an optimal network for various services as a slice. In this paper, we propose a radio access network (RAN) slicing method that flexibly allocates RAN resources using deep reinforcement learning (DRL). In RANs, the number of slices controlled by a base station fluctuates in terms of user ingress and egress from the base station coverage area and service switching on the respective sets of user equipment. Therefore, when resource allocation depends on the number of slices, resources cannot be allocated when the number of slices changes. We consider a method that makes optimal-resource allocation independent of the number of slices. Resource allocation is optimized using DRL, which learns the best action for a state through trial and error. To achieve independence from the number of slices, we show a design for a model that manages resources on a one-slice-by-one-agent basis using Ape-X, which is a DRL method. In Ape-X, because agents can be employed in parallel, models that learn various environments can be generated through trial and error of multiple environments. In addition, we design a model that satisfies the slicing requirements without over-allocating resources. Based on this design, it is possible to optimally allocate resources independently of the number of slices by changing the number of agents. In the evaluation, we test multiple scenarios and show that the mean satisfaction of the slice requirements is approximately 97%
引用
收藏
页码:68183 / 68198
页数:16
相关论文
共 33 条
  • [1] Abiko Y, 2020, 2020 34TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2020), P420, DOI [10.1109/ICOIN48656.2020.9016577, 10.1109/icoin48656.2020.9016577]
  • [2] Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions
    Afolabi, Ibrahim
    Taleb, Tarik
    Samdanis, Konstantinos
    Ksentini, Adlen
    Flinck, Hannu
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (03): : 2429 - 2453
  • [3] [Anonymous], [No title captured]
  • [4] [Anonymous], 2019, 36213 TS 3GPP
  • [5] [Anonymous], 2015, ARXIV PREPRINT ARXIV
  • [6] [Anonymous], [No title captured]
  • [7] [Anonymous], 2018, 28801 TR 3GPP
  • [8] [Anonymous], [No title captured]
  • [9] Deep Reinforcement Learning A brief survey
    Arulkumaran, Kai
    Deisenroth, Marc Peter
    Brundage, Miles
    Bharath, Anil Anthony
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (06) : 26 - 38
  • [10] Chang CY, 2018, IEEE CONF COMPUT, P668