A Fair Scheduling Algorithm with Delay-Bandwidth Normalized Service Sharing

Fair queueing algorithms based on Generalized Processor Sharing (GPS) provide sessions with instantaneous fair sharing of server capacity, as well as guaranteed service rate and delay. From a long-term perspective, however, this type of sharing leads to a different quality of service to sessions even if they have the same weight, since it provides only the instantaneous capacity sharing without considering the accumulated service delay and bandwidth. To minimize such long-term unfairness, we propose a delay-bandwidth normalized scheduling model in which the concept of Value of Service (VoS) is defined from the aspects of both delay and bandwidth. Performance comparisons between the proposed algorithm and traditional fair queueing algorithms show that the proposed algorithm provides better long-term fairness among sessions and more adaptive scheduling to sessions with dynamic traffic patterns without compromising the guarantees of service rate and delay.