Group round robin: Improving the fairness and complexity of packet scheduling

2005 Symposium on Architectures for Networking and Communications Systems, ANCS 2005

Volumn , Issue , 2005, Pages 29-40

  Caprita, Bogdan ^a   Nieh, Jason ^a   Chan, Wong Chun ^a  

^a Fu Foundation School of Engineering and Applied Science   (United States)

Author keywords

Fair queuing; Quality of service; Scheduling; Stochastic processes queuing theory

Indexed keywords

FAIR QUEUING; FAIRNESS BOUNDS; FAIRNESS MEASURES; GROUPING STRATEGIES; NEW RESULTS; ORDER OF MAGNITUDE; PACKET SCHEDULING; ROUND ROBIN; ROUND-ROBIN SCHEDULING; SCHEDULING ACCURACY; STOCHASTIC PROCESSES/QUEUING THEORY; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY; PACKET NETWORKS; QUALITY CONTROL; QUEUEING THEORY; ROUTERS;

SCHEDULING ALGORITHMS;

EID: 34948832511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2005.4675263     Document Type: Conference Paper

References (22)

1. 2Q: Worst-case Fair Weighted Fair Queuing," in Proceedings of INFOCOM '96, San Francisco, CA, Mar. 1996.
2. J. Bennett and H. Zhang, "Hierarchical Packet Fair Queuing Algorithms," in Proceedings of ACM SIGCOMM '96, Aug. 1996.
3. B. Caprita, W. Chan and J. Nieh, "Group Round Robin: Improving the Fairness and Complexity of Packet Scheduling." Tech. Rep. CUCS-018-03, Department of Computer Science, Columbia University, June 2003.
4. B. Caprita, W. C. Chan, J. Nieh, C. Stein, and H. Zheng, "Group-Ratio Round Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems," in Proceedings of the 2005 USENIX Annual Technical Conference, USENIX, Anaheim, CA, April 2005.
5. W. Chan and J. Nieh, "Group ratio round-robin: An O(1) proportional share scheduler." Tech. Rep. CUCS-012-03, Department of Computer Science, Columbia University, April 2003.
6. S. Cheung and C. Pencea, "BSFQ: Bin Sort Fair Queuing," in Proceedings of INFOCOM ' 02, New York, NY, June 2002.
7. G. Chuanxiong, "SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks," in Proceedings of ACM SIGCOMM '01, Aug. 2001.
8. J. Cobb, M. Gouda, and A. El-Nahas, "Time-Shift Scheduling - Fair Scheduling of Flows in High-Speed Networks," in IEEE/ACM Transactions on Networking, June 1998.
9. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," in Proceedings of ACM SIGCOMM '89, Austin, TX, Sept. 1989.
10. S. J. Golestani, " A Self-Clocked Fair Queuing Scheme for Broadband applications," in Proceedings of IEEE INFOCOM '94, Apr. 1994.
11. P. Goyal, S. Lam, and H. Vin, "Determining End-to-End Delay Bounds in Heterogeneous Networks," in Proceedings NOSSDAV, Apr. 1995.
12. P. Goyal, H. Vin, and H. Cheng, "Start-Time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks," in IEEE/ACM Transactions on Networking, Oct. 1997.
13. L. Kleinrock, Queuing Systems, Volume II: Computer Applications. New York: John Wiley & Sons, 1976.
14. A. Parekh and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," in IEEE/ACM Transactions on Networking, 1(3), June 1993.
15. S. Ramabhadran and J. Pasquale, "Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay," in Proceedings of ACM SIGCOMM '03, Karlsruhe, Germany, August 2003.
16. M. Shreedhar and G. Varghese, "Efficient Fair Queuing Using Deficit Round-Robin," in Proceedings of ACM SIGCOMM '95, 4(3), Sept. 1995.
17. D. Stiliadis, and A. Varma, "Efficient Fair Queuing Algorithms for Packet-Switched Networks," in IEEE/ACM Transactions on Networking, Apr. 1998.
18. I. Stoica, H. Abdel-Wahab, and K. Jeffay, "On the Duality between Resource Reservation and Proportional Share Resource Allocation," in Multimedia Computing and Networking Proceedings, SPIE Proceedings Series, 3020, Feb. 1997.
19. C. Waldspurger, "Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management". PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Sept. 1995.
20. J. Xu and R. Lipton, "On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms," in Proceedings of ACM SIGCOMM '02, Pittsburgh, PA, August 2002.
21. X. Yuan and Z. Duan, "FRR: a Proportional and Worst-Case Fair Round Robin Scheduler," in Proceedings of INFOCOM '05, Miami, FL , Mar. 2005.
22. L. Zhang, "Virtual Clock: A New Traffic Control Algorithm for Packet Switched Networks," in ACM Transactions on Computer Systems, 9(2), May 1991.