An Intelligent Scheduling Architecture for Mixed Traffic in LTE-Advanced Networks

An Intelligent Scheduling Architecture for Mixed Traffic in LTE-Advanced Networks

Rehana Kausar, Yue Chen, Michael Chai
DOI: 10.4018/978-1-4666-4888-3.ch014
(Individual Chapters)
No Current Special Offers


In this chapter, an intelligent scheduling architecture is presented for the downlink transmission of LTE-Advanced networks to enhance the Quality of Service (QoS) provision to different traffic types while maintaining system level performance such as system throughput and fairness. Hebbian learning process and K-mean clustering algorithm are integrated in the time domain of the proposed scheduling architecture to intelligently allocate the available radio resource to Real Time (RT) and Non-Real Time (NRT) traffic types. The integration of these algorithms allows just enough resource allocation to RT traffic and diverts the remaining resource to NRT traffic to fulfil its minimum throughput requirements. System level simulation is set up for the performance evaluation, and simulation results show that the proposed scheduling architecture reduces average delay, delay violation probability, and average Packet Drop Rate (PDR) of RT traffic while guaranteeing the support of minimum throughput to NRT traffic and maintaining system throughput at good level.
Chapter Preview


The rapid development in all IP based next generation mobile communication networks, such as Long Term Evolution-Advanced (LTE-A), is expected to support the outburst of high-speed packet based applications. These applications have a large variety of QoS requirements such as reduced latency and packet loss rate and high throughput. Radio Resource Management (RRM) faces challenges when come across such a large variety of conflicting QoS requirements (Zhen, Yu-Kwong, Jianzhou, 2009). This is due to, limited radio resource, rapidly changing wireless channel conditions and ever increasing number of mobile users. Packet scheduling being one of the cores of RRM is very crucial to make an effective utilization of available radio resource (Rehana, 2010). In a scheduling algorithm, variable QoS requirements of different traffic types must be analysed and weighted appropriately to reach at a balanced solution (Zhen, Yu-Kwong, & Jianzhou, 2009).

The classic packet scheduling algorithms are Round Robin (RR), MAX C/I and Proportional Fairness (PF) algorithms. RR algorithm allocates resources cyclically thus achieving the maximum fairness. MAX C/I and PF algorithm exploit multiuser diversity to enhance system throughput. MAX C/I algorithm allocates a Physical Resource Block (PRB) to a user with the highest channel gain on that PRB, and can maximize the system throughput (Harri & Antti, 2009). PF algorithm takes both system throughput and fairness among users into consideration and allocates resources to users based on the ratio of their instantaneous throughput and acquired time averaged throughput (Stefania, Issam, & Matthew, 2009). However, RR, MAX C/I and PF algorithms aim only at improving fairness, system throughput or the trade-off between fairness and system throughput, respectively. QoS requirements, for example delay requirements of RT traffic or minimum throughput requirements of Non NRT traffic, are not considered at all. In the next generation of mobile communication networks, apart from system throughput and user fairness, the crucial point is to fulfill users’ QoS requirements in a multi-service and multi-user mixed traffic environment. This is because of resource contention among users of different traffic types. To allocate radio resources efficiently and intelligently in such complex environments is very challenging.

Complete Chapter List

Search this Book: