Weighted round robin packet scheduler using relative service share
Jong-Seon Kim, D.C. Lee · 2002
In this paper, we propose a new weighted round robin (WRR) algorithm for fixed length packets. Two well-known algorithms in the scheduling discipline are the packet-by-packet generalized processor sharing (PGPS) and the worst-case fair weighted fair queueing (WF/sup 2/Q). The WF/sup 2/Q has been suggested to eliminate the PGPS burstiness problem exhibited in a flow packet departure process. To the best of our knowledge, the smallest delay bound in the modification approaches of WRR was acquired from emulating the WF/sup 2/Q algorithm. Our proposed algorithm determines the packet service sequence without emulating the WF/sup 2/Q, which results in a low implementation complexity. The proposed scheduling algorithm also guarantees to a flow having a backlog continuous at a node that the departure time of each packet in that flow is no later than that in the GPS discipline.