QFQ: Efficient packet scheduling with tight guarantees

IEEE/ACM Transactions on Networking

Volumn 21, Issue 3, 2013, Pages 802-816

  Checconi, Fabio ^a   Rizzo, Luigi ^b   Valente, Paolo ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Algorithms; communication systems; computer network performance; data structures; packet scheduling

Indexed keywords

COMPARATIVE PERFORMANCE ANALYSIS; COST COMPONENTS; DELAY GUARANTEE; EXECUTION TIME; PACKET SCHEDULING; PROCESSING STEPS; SERVICE GUARANTEES; TIME COMPLEXITY;

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; NETWORK PERFORMANCE; OPTIMIZATION; PACKET NETWORKS; SCHEDULING;

DATA STRUCTURES;

EID: 84867048392     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2215881     Document Type: Article

References (24)

1. "The network simulator-ns-2, " 2012 [Online]. Available: http://www.isi. edu/nsnam/ns/
2. J. C. R. Bennet and H. Zhang, "Hierarchical packet fair queueing algorithms, " IEEE/ACM Trans. Netw., vol. 5, no. 5, pp. 675-689, Oct. 1997.
3. J. C. R. Bennett and H. Zhang, "WF Q: Worst-case fair weighted fair queueing, " in Proc. IEEE INFOCOM, Mar. 1996, pp. 120-128.
4. M. Carbone and L. Rizzo, "Dummynet revisited, " Comput. Commun. Rev., vol. 40, no. 2, pp. 12-20, 2010.
5. F. Checconi, P. Valente, and L. Rizzo, "QFQ: Efficient packet scheduling with tight bandwidth distribution guarantees (full paper and experimental code), " 2012 [Online]. Available: http://info. iet. unipi. it/~luigi/qfq/
6. C. Guo, "SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks, " in Proc. ACM SIGCOMM, Aug. 2001, pp. 211-222.
7. C. Guo, "G-3:An time complexity packet scheduler that provides bounded end-to-end delay, " in Proc. IEEE INFOCOMM, May 2007, pp. 1109-1117.
8. M. Karsten, "SI-WF Q: approximation with small constant execution overhead, " in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-12.
9. M. Karsten, "Approximation of generalized processor sharing with stratified interleaved timer wheels, " IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 708-721, Jun. 2010.
10. A. Kortebi, L. Muscariello, S. Oueslati, and J. Roberts, "Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing, " Perform. Eval. Rev., vol. 33, no. 1, pp. 217-228, 2005.
11. L. Lenzini, E. Mingozzi, and G. Stea, "Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers, " IEEE/ACM Trans. Netw., vol. 12, no. 4, pp. 681-693, Aug. 2004.
12. L. L. Peterson and B. S. Davie, Computer Networks-A Systems Approach. San Mateo, CA: Morgan Kaufmann, 2010.
13. S. Ramabhadran and J. Pasquale, "The stratified round robin scheduler: Design, analysis and implementation, " IEEE/ACM Trans. Netw., vol. 14, no. 6, pp. 1362-1373, Dec. 2006.
14. L. Rizzo, "Revisiting network I/O APIs: The netmap framework, " Commun. ACM, vol. 55, no. 3, pp. 45-51, Mar. 2012.
15. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin, " IEEE/ACM Trans. Netw., vol. 4, no. 3, pp. 375-385, Jun. 1996.
16. S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications, " in Proc. IEEE INFOCOM, Jun. 1994, pp. 636-646.
17. D. C. Stephens, J. C. R. Bennett, and H. Zhang, "Implementing scheduling algorithms in high-speed networks, " IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1145-1158, Jun. 1999.
18. D. Stiliadis and A. Varma, "A general methodology for designing efficient traffic scheduling and shaping algorithms, " in Proc. IEEE INFOCOM, Apr. 1997, pp. 326-335.
19. I. Stoica and H. Abdel-Wahab, "Earliest eligible virtual deadline first: A flexible and accurate mechanism for proportional share resource allocation, " Department of Computer Science, Old DominionUniversity, Norfolk, VA, Tech. Rep. 95-22, Nov. 1995.
20. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock: A new fair queuing scheme with guaranteed delays and throughput fairness, " in Proc. IEEE INFOCOM, Apr. 1997, pp. 557-565.
21. P. Valente, "Exact GPS simulation and optimal fair scheduling with logarithmic complexity, " IEEE/ACM Trans. Netw., vol. 15, no. 6, pp. 1454-1466, Dec. 2007.
22. P. Valente, "Extending to support a dynamic traffic mix, " in Proc. AAA-IDEA, Jun. 2005, pp. 26-33.
23. J. Xu and R. J. Lipton, "On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms, " IEEE/ACM Trans. Netw., vol. 13, no. 1, pp. 15-28, Feb. 2005.
24. X. Yuan and Z. Duan, "Fair round-robin: A low complexity packet scheduler with proportional and worst-case fairness, " IEEE Trans. Comput., vol. 58, no. 3, pp. 365-379, Mar. 2009.