IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2023i1p18-d1311576.html
   My bibliography  Save this article

Controllable Queuing System with Elastic Traffic and Signals for Resource Capacity Planning in 5G Network Slicing

Author

Listed:
  • Irina Kochetkova

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia
    Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilova St., 119333 Moscow, Russia)

  • Kseniia Leonteva

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia)

  • Ibram Ghebrial

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia)

  • Anastasiya Vlaskina

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia)

  • Sofia Burtseva

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia)

  • Anna Kushchazli

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia)

  • Konstantin Samouylov

    (Institute of Computer Science and Telecommunications, RUDN University, 6 Miklukho-Maklaya St., 117198 Moscow, Russia
    Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilova St., 119333 Moscow, Russia)

Abstract

Fifth-generation (5G) networks provide network slicing capabilities, enabling the deployment of multiple logically isolated network slices on a single infrastructure platform to meet specific requirements of users. This paper focuses on modeling and analyzing resource capacity planning and reallocation for network slicing, specifically between two providers transmitting elastic traffic, such during as web browsing. A controller determines the need for resource reallocation and plans new resource capacity accordingly. A Markov decision process is employed in a controllable queuing system to find the optimal resource capacity for each provider. The reward function incorporates three network slicing principles: maximum matching for equal resource partitioning, maximum share of signals resulting in resource reallocation, and maximum resource utilization. To efficiently compute the optimal resource capacity planning policy, we developed an iterative algorithm that begins with maximum resource utilization as the starting point. Through numerical demonstrations, we show the optimal policy and metrics of resource reallocation for two services: web browsing and bulk data transfer. The results highlight fast convergence within three iterations and the effectiveness of the balanced three-principle approach in resource capacity planning for 5G network slicing.

Suggested Citation

  • Irina Kochetkova & Kseniia Leonteva & Ibram Ghebrial & Anastasiya Vlaskina & Sofia Burtseva & Anna Kushchazli & Konstantin Samouylov, 2023. "Controllable Queuing System with Elastic Traffic and Signals for Resource Capacity Planning in 5G Network Slicing," Future Internet, MDPI, vol. 16(1), pages 1-23, December.
  • Handle: RePEc:gam:jftint:v:16:y:2023:i:1:p:18-:d:1311576
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/1/18/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/16/1/18/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Efrosinin, Dmitry & Sztrik, Janos, 2018. "An algorithmic approach to analysing the reliability of a controllable unreliable queue with two heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 271(3), pages 934-952.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Srinivas R. Chakravarthy & Alexander N. Dudin & Sergey A. Dudin & Olga S. Dudina, 2023. "Queueing System with Potential for Recruiting Secondary Servers," Mathematics, MDPI, vol. 11(3), pages 1-24, January.
    2. Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik & Andreas Plank, 2020. "Approximations in Performance Analysis of a Controllable Queueing System with Heterogeneous Servers," Mathematics, MDPI, vol. 8(10), pages 1-18, October.
    3. Dmitry Efrosinin & Natalia Stepanova, 2021. "Estimation of the Optimal Threshold Policy in a Queue with Heterogeneous Servers Using a Heuristic Solution and Artificial Neural Networks," Mathematics, MDPI, vol. 9(11), pages 1-14, May.

    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:jftint:v:16:y:2023:i:1:p:18-:d:1311576. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.