A queue length-based scheduling scheme in ATM networks

Abstract

We propose a new scheduling algorithm, named queue length-based weighted round robin (QL-WRR), in order to improve the efficiency of the WRR under a burst traffic environment. The proposed scheme can efficiently support the burst traffic by using a threshold value of a queue length and a weight-up factor. Through a simulation study, we evaluate performances of the proposed scheme and compare the scheme with the round robin and WRR disciplines, in terms of the mean cell delay, 99 percentile cell delay bound, and cell loss rate.