RQRR:A New Fair and Efficient Packet Scheduling Algorithm
Guikai Liu, Lei Gao · 2013
Aiming at variable length packet queues,a new packet scheduling algorithm named Resilient Quantum Round Robin(RQRR)was presented.Different from existent algorithms,the quantum given to each of the flows in a round is not fixed and is calculated depending on the transmission situation of all the flows in the previous round.The theoretical analyses show that the relative fairness measure of RQRR has an upper bound of 7Max-1,where Max is the largest size of the packets.RQRR takes O(1)processing complexity per packet and is simple to implement at high-speed networks.