“…The proposed scheme, namely, Queue-Length based Scheduling (QLS), monitors the instantaneous occupancy of n queues. The algorithm marks two thresholds on the queue, a minimum threshold, T min , and a maximum threshold, T max (Fig.1), just as RED [15] does. Suppose QL i is current queue size of flow i, where QL i ≧ 0, and i= 1, 2, …,n.…”