TY - GEN
T1 - Radio resource allocation for extreme URLLC under partial knowledge of arrival distributions
AU - Abdullah, Mohammed
AU - Elayoubi, Salah Eddine
AU - Chahed, Tijani
AU - Lisser, Abdel
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - We address radio resource allocation for the transport of extreme Ultra Reliable Low Latency and Reliability (URLLC) traffic. One illustrative use case is factory automation using 6G networks. In this context, extreme URLLC has very stringent Quality of Service (QoS) requirements: 0.1 ms for the delay and 10-7 for the reliability. Reliability can be even higher for other use cases. We model QoS in terms of outage probability, that is the likelihood of failing to serve at least one packet due to insufficient resources, and derive the minimal resource reservation that would meet such requirement. We formulate the problem as chance-constrained optimization and solve it assuming partial knowledge of arriving traffic distribution. We treat the case where traffic is described through its mean and variance, and make use of three approaches to find the optimal solution: distributionally robust using worst-case value at risk approach, distribution-based approximation and bounds from large deviation theory. We also solve the optimization problem using a data driven approach and propose a sliding window mechanism to perform it online. We compare the performance of the aforementioned approaches numerically and show the effectiveness of the data driven approach, accounting for user radio condition heterogeneity and thus different Modulation and Coding Schemes.
AB - We address radio resource allocation for the transport of extreme Ultra Reliable Low Latency and Reliability (URLLC) traffic. One illustrative use case is factory automation using 6G networks. In this context, extreme URLLC has very stringent Quality of Service (QoS) requirements: 0.1 ms for the delay and 10-7 for the reliability. Reliability can be even higher for other use cases. We model QoS in terms of outage probability, that is the likelihood of failing to serve at least one packet due to insufficient resources, and derive the minimal resource reservation that would meet such requirement. We formulate the problem as chance-constrained optimization and solve it assuming partial knowledge of arriving traffic distribution. We treat the case where traffic is described through its mean and variance, and make use of three approaches to find the optimal solution: distributionally robust using worst-case value at risk approach, distribution-based approximation and bounds from large deviation theory. We also solve the optimization problem using a data driven approach and propose a sliding window mechanism to perform it online. We compare the performance of the aforementioned approaches numerically and show the effectiveness of the data driven approach, accounting for user radio condition heterogeneity and thus different Modulation and Coding Schemes.
UR - https://www.scopus.com/pages/publications/85215945433
U2 - 10.1109/PIMRC59610.2024.10817330
DO - 10.1109/PIMRC59610.2024.10817330
M3 - Conference contribution
AN - SCOPUS:85215945433
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
BT - 2024 IEEE 35th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 35th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2024
Y2 - 2 September 2024 through 5 September 2024
ER -