Capacity evaluation for LTE applications considering queue overflow

Abstract

In this study, the authors evaluate the capacity by summation of granted bit rates in their proposed quality of service-aware scheduling strategy for long term evolution (LTE). To provision differentiation, the scheduling technique prioritises the queues for high priority (HP) applications against their low priority (LP) counterparts. Fairness, on the other hand, is supported by considering queue overflow of LP applications. They utilised the principles of a random variable to derive equations for the capacities offered by their method and used the token bucket technique to address the principle of the guaranteed-bit-rate for HP applications, referring to the guaranteed capacity in LTE. Experimental findings confirm that their strategy could extend the capacity granted to LP applications and simultaneously maintain the capacity condition for HP applications. The results also show relative improvement and acceptable degradation in the capacities granted to the LP and HP applications in their scheme when compared with other methods.