Delay aware resource allocation in ORAN through network optimization

Abstract

AbstractA multi variable resource allocation problem is investigated in network environments, specifically focusing on the consideration of quality of service in open radio access network. The main objective is to minimise the combined latency of various servers while complying with network limitations. The delay of each server is represented by a non‐linear function that has exponentially based. This characteristic inherently brings non‐convexity into the objective function. In contrast, the constraints comprise various linear combinations of network variables, including resource block allocations, power consumption, and number of virtual machines. The purpose of these constraints is to guarantee that the allocation of resources adheres to practical limitations and upholds fairness among servers. Nevertheless, the inclusion of a non‐convex objective function significantly adds complexity to the optimisation problem and non‐convex behaviour, requiring specialised algorithms and techniques to identify solutions. Subsequently, the Lagrange multiplier method has been used to solve this problem mathematically. Numerically, three algorithms have been utilised and compared to solve the problem, these are active‐set, interior point and sequential quadratic programming. Note that the total delay as an objective function is based on the total power consumption of the servers. Previous to optimising the total delay, a delay model is proposed and compared with two research works that are based on experimental and real time data. The proposed model shows data matching with the other works and permits for more adaptation/integration with any other works that uses different servers’ characteristics and network parameters.