Performance of URLLC Traffic Scheduling Policies with Redundancy - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Performance of URLLC Traffic Scheduling Policies with Redundancy

Résumé

In this paper, we study the performance of packet scheduling schemes for Ultra-Reliable Low-Latency Communications (URLLC) services. In order to ensure a low queuing time, we exploit the redundant coverage in many 5G Radio Access Networks (RAN) scenarios, where two frequency layers or Radio Access Technologies (RAT) are integrated. We consider three packet scheduling and redundancy schemes, namely Join-the-Shortest-Queue (JSQ), systematic Redundancy (RED), and redundancy with Cancellation upon completion (CAN). On the basis of queuing theory results, we develop expressions for the reliability, defined as the probability that the packet is transmitted before some given target delay. We show that RED has a good performance at low load, while JSQ is better when the load increases; CAN outperforms all other schemes. We then show how the obtained results can be used for the dimensioning of needed 5G radio resources and discuss the trade-off between performance and implementation complexity.
Fichier non déposé

Dates et versions

hal-03519943 , version 1 (10-01-2022)

Identifiants

Citer

Abdellatif Chagdali, Salah Eddine Elayoubi, Antonia Maria Masucci, Alain Simonian. Performance of URLLC Traffic Scheduling Policies with Redundancy. 2020 32nd International Teletraffic Congress (ITC 32), Sep 2020, Osaka, Japan. pp.55-63, ⟨10.1109/ITC3249928.2020.00015⟩. ⟨hal-03519943⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More