Delay Minimization of Task Offloading in O-RAN Architecture

In this paper, we propose a heuristic algorithm for minimizing the delay of task offloading within the open radio access network (O-RAN) architecture. We model the O-RAN architecture using a directed graph connecting its various components. Assuming that frequency-division multiplexing (FDM) is used between all users sharing the same communication link, and applying the M/M/1 queueing model at the O-RAN central units (O-CUs), we update the graph weights and design a heuristic algorithm to provide delay-efficient routing for all users. Numerical results demonstrate the performance of the algorithm and provide insights into the O-RAN architecture.