A Capacity and Minimum Guarantee-Based Service Class-Oriented Scheduler for LTE Networks
Quality-of-Service (QoS) requirements have always posed a challenge from scheduling perspective and it becomes more complicated with the emergence of new standards and applications. Classical techniques like maximum throughput, proportional fair and exponential rule have been used in common network scenarios but these techniques fail to address diverse service requirements for QoS provisioning in Long-Term Evolution (LTE). These QoS requirements in LTE are implemented in the form of delay budgets, scheduling priorities, and packet loss rates. Scheduler design for LTE networks therefore requires handling service class attributes but preciously proposed scheduling methods ignored service class-based design and focused more on single network prospect.