Delay and Fairness Analysis of C-RAN for Single and Multi Scheduling Domain Strategies

Abstract

Background: Centralized Radio Access Network (C-RAN) is the most promising network architecture for next-generation communication networks. It meets the need for flexibility on fronthaul as well as large bandwidth on backhaul of the network. All along, scheduling is very important for the transmission of information in an organized manner. C-RAN has not been studied with the scheduling domain strategies yet in the literature. Objective: In this work, packet transmission duration, overall transmission time, wait time, and fairness index parameters have been calculated and analysed for C-RAN architecture for two different scheduling domains. The total transmission cycle time parameter is calculated for the three upper functional split options of C-RAN. The overall transmission time is a parameter calculated for the entire uplink channel. Methods: To implement the network scenario, extensive scripting is done on MATLAB Editor for single scheduling domain (SSD) and multi-scheduling domain (MSD) for three higher functional split options of C-RAN. The data traffic generated in the network is considered random. Results: A closer examination of results reveals the advantages and disadvantages of both algorithms, as well as trade-offs between them. Conclusion: For quicker data transmission, SSD should be preferred whereas MSD should be preferred if multiple users want to access resources simultaneously. Lower functional split options of C-RAN require less transmission cycle time. The MSD technique is fairer than SSD.