Issue No.03 - March (2009 vol.58)
Xin Yuan , Florida State University, Tallahassee
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.176
Round robin based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low complexity round robin scheduler, called Fair Round Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the stratified round robin scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round robin based low complexity packet schedulers. FRR offers better short-term fairness than stratified round robin and other existing round robin schedulers.
packet scheduling, round-robin scheduler, proportional fairness, worst-case fairness
Xin Yuan, "Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness", IEEE Transactions on Computers, vol.58, no. 3, pp. 365-379, March 2009, doi:10.1109/TC.2008.176