%0 Conference Paper %1 abd20ITC32 %A Chagdali, Abdellatif %A Elayoubi, Salah Eddine %A Antonia, Maria Masucci %A Simonian, Alain %B 32th International Teletraffic Congress (ITC 32) %C Osaka, Japan %D 2020 %K 5G Delay_Distribution Redundancy Resource_Allocation Systems_of_Parallel_Queues URLLC itc itc32 %T Performance of URLLC Traffic Scheduling Policies with Redundancy %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/abd20ITC32.pdf?inline=true %X 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 Jointhe-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.

@inproceedings{abd20ITC32, abstract = {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 Jointhe-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.}, added-at = {2021-03-02T15:22:25.000+0100}, address = {Osaka, Japan}, author = {Chagdali, Abdellatif and Elayoubi, Salah Eddine and Antonia, Maria Masucci and Simonian, Alain}, biburl = {https://www.bibsonomy.org/bibtex/2505fb27ac7c22516c87996aa81ae9979/itc}, booktitle = {32th International Teletraffic Congress (ITC 32)}, interhash = {15f387ac083805c7d3f794a606e6faf2}, intrahash = {505fb27ac7c22516c87996aa81ae9979}, keywords = {5G Delay_Distribution Redundancy Resource_Allocation Systems_of_Parallel_Queues URLLC itc itc32}, timestamp = {2021-03-02T15:22:25.000+0100}, title = {Performance of URLLC Traffic Scheduling Policies with Redundancy}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/abd20ITC32.pdf?inline=true}, year = 2020 }