Resource Allocation in Open RAN Networks: An Elasticity Approach for Network Slicing
Network slicing; open RAN; 5G; xApp
This master's thesis proposes developing an Open RAN solution for dynamic bandwidth scheduling using network slicing in 5G systems. The proof-of-concept methodology uses a 5G Open RAN network based on the O-RAN Alliance architecture. The study analyzes and implements two resource allocation algorithms in the RAN: Fixed Slice Scheduling (FSS), which employs a fixed allocation policy, and Guaranteed Bandwidth Slice Scheduling (GBSS), which reserves a minimum bandwidth and dynamically allocates a portion of shared bandwidth on demand. The algorithms were used as xApps of the Near-Real-Time RAN Intelligent Controller (near-RT RIC). The investigation of FSS highlights the limitations of its static nature, especially when the offered rate of users varies over time. GBSS, on the other hand, distributes shared bandwidth according to the packet loss behavior of network slices, aiming to maximize the delivery of correct packets. For scenarios with controlled load and time-varying transmission rate demand, the application of GBSS results in low packet loss, surpassing FSS in all tested cases.