Quantum Varying Deficit Round Robin Scheduling Over Priority Queues

At the time of this paper writing, all scheduling algorithms are looking for tradeoffs between low complexity, low latency, and fairness. The priority queuing (PQ) scheduling can meet the requirements of real-time applications but is not good at fairness; sorted priority algorithms like WFQ, achieve better results in latency and fairness by calculating priorities dynamically at the cost of work complexity up to O(log(n)) (where n is the number of queues); frame- based schemes such as DRR, resolve the fairness variable length packets transmitting with O(1) work complexity, but sacrifice latency performance. In this paper, we break off the relationship between the duration packet stays in queue and the number of the queue having been served. We set the priority for each queue, insert packets into different queues according to their real-time needs. Then over all of them, we run Quantum Varying DRR algorithm we proposed, which keeps not only all advantages DRR has, but provides better low latency than DRR. It also achieves the fairness of Max (Max is the longest size of packets coming from all input links.). Analytical results and simulations verify all these characteristics.