|
Keywords
|
Open radio access network, congestion control, queue, knapsack problem, resource management
|
|
Abstract
|
The increasing traffic in densely populated areas has led to congestion issues in open radio access networks (O-RAN). In this research, we address the problem of congestion in O-RAN and aim to minimize it utilizing mixed integer programming (MIP) techniques. Our focus is on the traffic steering between central unit (CU) and distributed unit (DU). In this way, we try to allocate the incoming prioritized packets to radio units (RUs) in a way that minimize the queue at DUs in an O-RAN architecture. We have developed an algorithm to transform the issue into a constrained multi-knapsack problem (MKP) and have introduced a solution to address it. The simulation results demonstrate that the presented algorithm can reduce the mean delay of packets up to 20% respect to normal condition.
|