Joint Routing and Packet Scheduling For URLLC and eMBB traffic in 5G O-RAN
- Resource Type
- Conference
- Authors
- Zhang, Cheng Cheng; Nguyen, Kim Khoa; Cheriet, Mohamed
- Source
- ICC 2022 - IEEE International Conference on Communications Communications, ICC 2022 - IEEE International Conference on. :1900-1905 May, 2022
- Subject
- Communication, Networking and Broadcast Technologies
Program processors
Scheduling algorithms
Quality of service
Reinforcement learning
Ultra reliable low latency communication
Routing
Scheduling
O-RAN
5G
Joint Routing and packet Scheduling
Centralized O-DU Pool
Multiple Routes
Parallel Processors
- Language
- ISSN
- 1938-1883
Open Radio Access Network (O-RAN) is an innovative RAN architecture designed to revolutionize 5G-and-beyond mobile networks. O-RAN virtualizes the fronthaul network functions into Open Centralized Unit (O-CU), Open Distributed Unit (O-DU) and Open Radio Unit (O-RU). Unfortunately, there is no standard data communication mechanism to disaggregate Quality of Service (QoS) flow traffic into multiple routes to access O-DUs to leverage the distributed computing capability. Furthermore, there is no centralized scheduler to coordinate processors that are processing O-DU functions efficiently to meet fifth generation (5G) QoS services. Therefore, O-RAN performance is still questionable. This paper investigates an optimized solution for joint Routing and Packet Scheduling (RPS) which is implemented in the O-DU pool to replace individual O-DUs. We formulate two joint RPS problems to coordinate multiple routes and multiple parallel processors in the centralized O-DU pool to accommodate the Ultra-Reliable Low Latency Communications (URLLC) and enhanced Mobile Broadband (eMBB) services. We propose a greedy algorithm and a Min-Max algorithm to approximate the optimal result. Numerical results show that our proposed solution improves significantly system processing delay compared with a scheme of individual O-DUs which are selfishly maximized.