Performance Evaluation of Round Robin and Proportional Fair Scheduling Algorithms for Constant Bit Rate Traffic in LTE

Scheduling is a key Radio Resource Management (RRM) mechanism for realizing Quality of Service (QoS) requirements and optimizing system performance of Long Term Evolution (LTE) network. Scheduling is the process of dynamically allocating physical resources to User Equipments (UEs) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network designers/researchers as the implementation of scheduling algorithm is an open issue in LTE standard. The choice of scheduling algorithm critically impacts resource utilization and the overall performance of LTE network. This paper makes an attempt to study and compare the performance of Round Robin (RR) and Proportional Fair (PF) scheduling algorithms for Constant Bit Rate (CBR) traffic scenario. Performance metrics considered for simulation studies are throughput, delay and jitter