This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness
March 2009 (vol. 58 no. 3)
pp. 365-379
Xin Yuan, Florida State University, Tallahassee
Zhenhai Duan, Florida State University, Tallahassee
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.

[1] J. Bennett and H. Zhang, “Hierarchical Packet Fair Queueing Algorithms,” ACM/IEEE Trans. Networking, vol. 5, no. 5, pp.675-689, Oct. 1997.
[2] J. Bennett and H. Zhang, “$WF^{2}Q$ : Worst Case Fair Weighted Fair Queuing,” Proc. IEEE INFOCOM '96, pp. 120-128, 1996.
[3] B. Caprita, J. Nieh, and W. Chan, “Group Round Robin: Improving the Fairness and Complexity of Packet Scheduling,” Proc. Symp. Architecture for Networking and Comm. Systems (ANCS'05), pp. 29-40, 2005.
[4] S. Cheung and C. Pencea, “BSFQ: Bin Sort Fair Queuing,” Proc. IEEE INFOCOM '02, pp. 1640-1649, 2002.
[5] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queuing Algorithm,” Proc. ACM SIGCOMM '89, pp. 1-12, 1989.
[6] S. Golestani, “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” Proc. IEEE INFOCOM '94, pp. 636-646, 1994.
[7] C. Guo, “SRR, an O(1) Time Complexity Packet Scheduler for Flows in MultiService Packet Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 6, pp. 1144-1155, Dec. 2004.
[8] L. Lenzini, E. Mingozzi, and G. Stea, “Aliquem: A Novel DRR Implementation to Achieve Better Latency and Fairness at O(1) Complexity,” Proc. 10th Int'l Workshop Quality of Service (IWQoS'02), pp. 77-86, 2002.
[9] L. Lenzini, E. Mingozzi, and G. Stea, “Tradeoffs between Low Complexity, Low Latency, and Fairness with Deficit Round-Robin Schedulers,” IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 681-693, Apr. 2004.
[10] L. Massouli and J. Roberts, “Bandwidth Sharing: Objectives and Algorithms,” IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 320-328, June 2002.
[11] The Network Simulator—ns-2, http://www.isi.edu/nsnamns, 2008.
[12] A. Parekh and R. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp.344-357, June 1993.
[13] S. Ramabhadran and J. Pasquale, “The Stratified Round Robin Scheduler: Design, Analysis, and Implementation,” IEEE/ACM Trans. Networking, vol. 14, no. 6, pp. 1362-1373, Dec. 2006.
[14] J. Rexford, A. Greenberg, and F. Bonomi, “Hardware-Efficient Fair Queueing Architectures for High-Speed Networks,” Proc. IEEE INFOCOM '96, pp. 638-646, 1996.
[15] J.L. Rexford, F. Bonomi, A. Greenberg, and A. Wong, “A Scalable Architecture for Fair Leaky-Bucket Shaping,” Proc. IEEE INFOCOM '97, pp. 1056-1064, 1997.
[16] D. Stiliadis and A. Varma, “Design and Analysis of Frame-Based Fair Queueing: A New Traffic Scheduling Algorithm for Packet-Switched Networks,” Proc. ACM SIGMETRICS '96, pp. 104-115, 1996.
[17] M. Shreedhar and G. Varghese, “Efficient Fair Queuing Using Deficit Round Robin,” Proc. ACM SIGCOMM '95, pp. 231-242, 1995.
[18] S. Suri, G. Varghese, and G. Chandranmenon, “Leap Forward Virtual Clock: An $O(log log\;N)$ Queuing Scheme with Guaranteed Delays and Throughput Fairness,” Proc. IEEE INFOCOM '97, pp.557-565, 1997.
[19] P. Valente, “Exact GPS Simulation with Logarithmic Complexity, and Its Application to an Optimally Fair Scheduler,” Proc. ACM SIGCOMM '04, pp. 269-280, 2004.
[20] J. Xu and R.J. Lipton, “On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms,” Proc. ACM SIGCOMM '02, pp. 279-292, 2002.
[21] X. Yuan and Z. Duan, “Fair Round Robin: A Low Complexity Packet Scheduler with Proportional and Worst-Case Fairness,” Technical Report TR-080201, Dept. Computer Science, Florida State Univ., Feb. 2008.
[22] L. Zhang, “Virtual Clock: A New Traffic Control Scheme for Packet Switching Networks,” Proc. ACM SIGCOMM '90, pp. 19-29, 1990.
[23] Q. Zhao and J. Xu, “On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling,” Proc. IEEE INFOCOM '04, pp. 2383-2392, 2004.

Index Terms:
packet scheduling, round-robin scheduler, proportional fairness, worst-case fairness
Citation:
Xin Yuan, Zhenhai Duan, "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
Usage of this product signifies your acceptance of the Terms of Use.