Author
Listed:
- Daria Ivanova
(Applied Informatics and Probability Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia)
- Yves Adou
(Applied Informatics and Probability Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia)
- Ekaterina Markova
(Applied Informatics and Probability Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia)
- Yuliya Gaidamaka
(Applied Informatics and Probability Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia
Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences (FRC CSC RAS), 44-2 Vavilov St, 119333 Moscow, Russia)
- Konstantin Samouylov
(Applied Informatics and Probability Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia)
Abstract
Fifth-generation (5G) New Radio (NR) systems are expected to support multiple traffic classes including enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine-type communications (mMTC) at the same air interface. This functionality is assumed to be implemented by utilizing the network slicing concept. According to the 3rd Generation Partnership Project (3GPP), the efficient support of this feature requires statistical multiplexing and, at the same time, traffic isolation between slices. In this paper, we formulate and solve a mathematical model for a class of Radio Access Network (RAN) slicing algorithms that simultaneously include resource reservation and a priority-based service discipline allowing us to incur fine granularity in the service processes of different traffic aggregates. The system is based on a queueing model and allows parametrization by accounting for the specifics of wireless channel impairments. As metrics of interest, we utilize K -class session drop probability, K -class session pre-emption probability, and system resource utilization. To showcase the capabilities of the model, we also compare performance guarantees provided for URLLC, eMBB, and mMTC traffic when multiplexed over the same NR radio interface. Our results demonstrate that the performance trade-off is dictated by the offered traffic load of the highest priority sessions: (i) when it is small, mixed reservation/priority scheme outperforms the full reservation mechanism; (ii) for overloaded conditions, full reservations provides better traffic isolation. The mixed strategy is beneficial to traffic aggregates with short-lived lightweight sessions, such as URLLC and mMTC, while the reservation only scheme works better for elastic eMBB traffic. The most important feature is that the mixed strategy allows resource utilization to be improved up to 95%, which is 10–15% higher compared to the reservation-only scheme while still providing isolation between traffic types.
Suggested Citation
Daria Ivanova & Yves Adou & Ekaterina Markova & Yuliya Gaidamaka & Konstantin Samouylov, 2023.
"Mathematical Framework for Mixed Reservation- and Priority-Based Traffic Coexistence in 5G NR Systems,"
Mathematics, MDPI, vol. 11(4), pages 1-15, February.
Handle:
RePEc:gam:jmathe:v:11:y:2023:i:4:p:1046-:d:1073050
Download full text from publisher
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.
- Meenakshi Kandpal & Niharika Keshari & Amrendra Singh Yadav & Mohit Yadav & Rabindra Kumar Barik, 2024.
"Modelling of blockchain based queuing theory implementing preemptive and non-preemptive algorithms,"
International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(6), pages 2554-2570, June.
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:4:p:1046-:d:1073050. 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.