A practical fair queuing scheduler: Simplification through quantization

The design of fair packet schedulers involves a tradeoff between implementation complexity, on one hand, and delay and fairness guarantees, on the other. In this paper, we present tiered-service fair queuing (TSFQ), a new scheduler that exploits certain properties of Internet traffic to speed up the bottleneck operations related to virtual time computation and packet sorting. Specifically, TSFQ makes innovative use of quantization (along the two dimensions of flow weights and packet lengths) her with specialized yet simple queuing structures. TSFQ combines all three properties that are important to a fair queuing algorithm, namely, a tight delay bound, worst-case fairness, and low complexity and amenability to hardware implementation. Hence, we believe that, for network operators, deploying TSFQ scheduling has the potential to enhance their ability to offer and guarantee a wide range of services.

[1]  George N. Rouskas,et al.  On Bandwidth Tiered Service , 2009, IEEE/ACM Transactions on Networking.

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[3]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[4]  George N. Rouskas.  Internet Tiered Services: Theory, Economics, and Quality of Service , 2009 .

[5]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Shrikrishna Girish Khare.  Testbed Implementation and Performance Evaluation of the Tiered Service Fair Queuing (TSFQ) Packet Scheduling Discipline. , 2008 .

[7]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, Proceedings of INFOCOM '97.

[8]  X. Yuan,et al.  FRR: a proportional and worst-case fair round robin scheduler , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  T. Mexia,et al.  Author ' s personal copy , 2009 .

[10]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[11]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[12]  George N. Rouskas,et al.  A Practical and Efficient Implementation of WF2Q+ , 2007, 2007 IEEE International Conference on Communications.

[13]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[14]  Richard J. Lipton,et al.  On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms , 2002, IEEE/ACM Transactions on Networking.

[15]  Hui Zhang,et al.  Implementing scheduling algorithms in high-speed networks , 1999, IEEE J. Sel. Areas Commun..

[16]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[17]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  George N. Rouskas,et al.  An economic model for pricing tiered network services , 2009, 2009 IEEE International Conference on Communications.

[19]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[20]  Joseph Pasquale,et al.  Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay , 2003, SIGCOMM '03.

[21]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[22]  Chuanxiong Guo,et al.  SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks , 2004, IEEE/ACM Transactions on Networking.

[23]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[24]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[25]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

[26]  Amudala Bhasker,et al.  Tiered-Service Fair Queueing (TSFQ): A Practical and Efficient Fair Queueing Algorithm , 2007 .

[27]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[28]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[29]  Corneliu S. Pencea,et al.  BSFQ: bin sort fair queueing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.