A Traffic Control Approach to Minimize Congestion in O-RAN Architecture

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 $\mathbf{2 0 \%}$ respect to normal condition.

Authors

Institutions

Publication Details

Published
2024-10-09
DOI
https://doi.org/10.1109/ist64061.2024.10843536
Primary Topic
Wireless Body Area Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Traffic Control Approach to Minimize Congestion in O-RAN Architecture

Hamed Alizadeh Ghazijahani, Mahmoud Atashbar, Ali Atashbar
Wireless Body Area Networks
article

A Traffic Control Approach to Minimize Congestion in O-RAN Architecture

Hamed Alizadeh Ghazijahani, Mahmoud Atashbar, Ali Atashbar
article en

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 $\mathbf{2 0 \%}$ respect to normal condition.

Azarbaijan Shahid Madani University (IR)
Sustainable cities and communities
Openalex Percentile: Top 76%
Wireless Body Area Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.