Fairness Assessment of the Adaptive Token Bank Fair Queuing Scheduling Algorithm

Adaptive token bank fair queuing (ATBFQ) algorithm has been proposed as a cross-layer scheduling technique for 4G wireless systems recently. This algorithm takes higher layer quality of service (QoS) attributes such as priorities, interflow fairness, and delay constraints into account. By selecting the user terminals (UTs) in a certain prioritized manner derived from QoS attributes, the performance of the UTs, suffering from high interference and/or shadowing in particular, can be improved. The ATBFQ algorithm has been tested in a multicell environment in the presence of intercell interference by comparing with reference Score Based (SB) and Round Robin (RR) algorithms. In this paper, we further analyze ATBFQ primarily with regard to fairness along with other performance metrics accessed in a more elaborate system considering varying interference and loading conditions. Furthermore, an adaptive method for the allocation of resources is proposed for ATBFQ parameter selection, and is shown to have better performance in various loading conditions. It is observed from simulation results that ATBFQ with adaptive parameter selection outperforms the reference schemes in terms of queuing delay and UT throughput for different network loading cases.