IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i3p760-d1055456.html
   My bibliography  Save this article

5G Multi-Slices Bi-Level Resource Allocation by Reinforcement Learning

Author

Listed:
  • Zhipeng Yu

    (School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China)

  • Fangqing Gu

    (School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China)

  • Hailin Liu

    (School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China)

  • Yutao Lai

    (School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China)

Abstract

As the centralized unit (CU)—distributed unit (DU) separation in the fifth generation mobile network (5G), the multi-slice and multi-scenario, can be better applied in wireless communication. The development of the 5G network to vertical industries makes its resource allocation also have an obvious hierarchical structure. In this paper, we propose a bi-level resource allocation model. The up-level objective in this model refers to the profit of the 5G operator through the base station allocating resources to slices. The lower-level objective in this model refers to the slices allocating the resource to its users fairly. The resource allocation problem is a complex optimization problem with mixed-discrete variables, so whether a resource allocation algorithm can quickly and accurately give the resource allocation scheme is the key to its practical application. According to the characteristics of the problem, we select the multi-agent twin delayed deep deterministic policy gradient (MATD3) to solve the upper slice resource allocation and the discrete and continuous twin delayed deep deterministic policy gradient (DCTD3) to solve the lower user resource allocation. It is crucial to accurately characterize the state, environment, and reward of reinforcement learning for solving practical problems. Thus, we provide an effective definition of the environment, state, action, and reward of MATD3 and DCTD3 for solving the bi-level resource allocation problem. We conduct some simulation experiments and compare it with the multi-agent deep deterministic policy gradient (MADDPG) algorithm and nested bi-level evolutionary algorithm (NBLEA). The experimental results show that the proposed algorithm can quickly provide a better resource allocation scheme.

Suggested Citation

  • Zhipeng Yu & Fangqing Gu & Hailin Liu & Yutao Lai, 2023. "5G Multi-Slices Bi-Level Resource Allocation by Reinforcement Learning," Mathematics, MDPI, vol. 11(3), pages 1-20, February.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:760-:d:1055456
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/3/760/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/3/760/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:760-:d:1055456. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.