Prioritized dynamic multitraffic scheduler for downlink in LTE

Abstract

Long Term Evolution (LTE) is an all IP packet system in which guaranteeing QoS is a real challenge. The LTE aims to provide a maximum data rates of 100Mbps for downlink and 50Mbps for uplink when 20 MHz bandwidth is used. The scheduler takes different considerations into account such as throughput and fairness when deciding the allocation of the scarce radio resources. Therefore the LTE MAC scheduler should consider not only the throughput optimization but also the QoS differentiations in an effective manner. The objective of this project is to focuses on enhancing the performance of LTE downlink scheduling. This project work proposes and implements a, "Dynamic Multitraffic Scheduler" which uses dynamic bandwidth and Resource Blocks (RBs) allocations based on number of service classes. The proposed scheduler also considers the different users channel conditions and tries to create a balance between the Quality of service (QoS) guarantees and the multi-user diversity in a proportional fair manner. Round Robin (RR), Best Channel Quality Indicator (BCQI), Proportional Fair (PF) and Opportunistic scheduling are investigated and compared for both existing and proposed scheduler.

End-to-end slicing of RAN based on next-generation optical access network

“…In traditional cellular networks, RAN elements (e.g., base stations) are often managed individually, making it challenging to adapt to dynamic traffic patterns and optimize resource utilization. However, in 5G networks scheduling algorithms such as Round Robin (RR) [21], Maximum Throughput (MT) [21], and Proportional Fairness (PF) [21] ensures that available resources are allocated to active users to meet their QoS demands. gNB has included a packet scheduler that used these algorithms for both the uplink and the downlink.…”

Enhanced PF Scheduling Algorithm for LTE Networks

“…The author [11], presents a proposal to improve the performance of the LTE downlink scheduler The scheduler algorithm implements a "Dynamic Multi-traffic Scheduler" using bandwidth allocation and resource blocks based on the number of classes of services. The proposed scheduler considers the different channel conditions of users and creates a balance between QoS guarantees and fairness for multi-users The author presents the results of the comparisons between the proposed dynamic and static scheduler algorithm.…”