Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay

Computer Communication Review

Volumn 33, Issue 4, 2003, Pages 239-250

  Ramabhadran, Sriram ^a   Pasquale, Joseph ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fair queuing; Output scheduling; Quality of service

Indexed keywords

ALGORITHMS; BANDWIDTH; PACKET SWITCHING; QUALITY OF SERVICE;

FAIR QUEUING; OUTPUT SCHEDULING;

INTERNET;

EID: 1242287709     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. BENNET, J., AND ZHANG, H. Hierarchical packet fair queueing algorithms. In ACM SIGCOMM '96 (1996).
2. 2Q : Worst case fair weighted fair queuing. In IEEE INFOCOM '96 (1996).
3. BLAKE, S. ET AL. An architecture for diffrentiated services. RFC 2475 (1998).
4. CHAN, W., AND NIEH, J. Group ratio round-robin: An 0(1) proportional share scheduler. Tech. Rep. CUCS-012-03, Department of Computer Science, Columbia University, April 2003.
5. CHEUNG, S., AND PENCEA, C. BSFQ: Bin sort fair queuing. In IEEE INFOCOM'02 (2002).
6. CHUANXIONG, G. SRR, an O(1) time complexity packet scheduler for flows in multi-service packet networks. In ACM SIGCOMM '01 (2001).
7. CLARK, D. The design philosophy of darpa internet protocols. In ACM SIGCOMM '88 (1998).
8. CLARK, D., AND FANG, W. Explicit allocation of best-effort packet delivery service. IEEE/ACM Transactions on Networking 6 (August 1998).
9. CLARK, D., SHENKER, S., AND ZHANG, L. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In ACM SIGCOMM '92 (1992).
10. DEMERS, A., KESHAV, S., AND SHENKER, S. Analysis and simulation of a fair queuing algorithm. In ACM SIGCOMM '89 (1989).
11. FIGUEIRA, N., AND PASQUALE, J. Leave-in-time: A new service discipline for real-time communications in a packet-switching network. In ACM SIGCOMM '95 (1995).
12. FIGUEIRA, N., AND PASQUALE, J. An upper bound on the delay for the virtual clock service discipline. IEEE/ACM Transactions on Networking 3 (August 1995).
13. FIGUEIRA, N., AND PASQUALE, J. A schedulability condition for deadline-based service disciplines. IEEE/ACM Transactions on Networking 5 (April 1997).
14. FLOYD, S., AND FALL, K. Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transactions on Networking 7 (August 1999).
15. FLOYD, S., AND JACOBSON, V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1 (August 1993).
16. FLOYD, S., AND JACOBSON, V. Link-share and resource management models for packet networks. IEEE/ACM Transactions on Networking 3 (August 1995).
17. GOLESTANI, S. A self-clocked fair queueing scheme for broadband applications. In IEEE INFOCOM'94 (1994).
18. GOYAL, P., AND VIN, H. Generalized guaranteed rate scheduling algorithms: A framework. IEEE/ACM Transactions on Networking 5 (August 1997).
19. LENZINI, L., MINGOZZI, E., AND STEA, G. Aliquem: a novel DRR implementation to achieve better latency and fairness at 0(1) complexity. In IWQoS'02 (2002).
20. MCKENNEY, P. Stochastic fair queueing. Internetworking: Research and Experience 2 (January 1991).
21. PAREKH, A., AND GALLAGER, R. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Transactions on Networking 1 (1993).
22. REXFORD, J., GREENBERG, A., AND BONOMI, F. Hardware-efficient fair queueing architectures for high-speed networks. In IEEE INFOCOM '96 (1996).
23. SAHA, D., MUKHERJEE, S., AND TRIPATHI, S. Carry-over round robin: A simple cell scheduling mechanism for ATM networks. IEEE/ACM Transactions on Networking 6 (1998).
24. SHREEDHAR, M., AND VARGHESE, G. Efficient fair queuing using deficit round robin. In ACM SIGCOMM '95 (1995).
25. STEPHENS, D., BENNET, J., AND ZHANG, H. Implementing scheduling algorithms in high speed networks. IEEE Journal on Selected Areas in Communications: Special Issue on Next-generation IP Switches and Routers 17 (June 1999).
26. STILIADIS, D., AND VARMA, A. Efficient fair queueing algorithms for packet switched networks. IEEE/ACM Transactions on Networking 6 (April 1998).
27. STILIADIS, D., AND VARMA, A. Rate proportional servers; A design methodology for fair queueing algorithms. IEEE/ACM Transactions on Networking 6 (April 1998).
28. SURI, S., VARGHESE, G., AND CHANDRANMENON, G. Leap forward virtual clock: An O(loglog N) queuing scheme with guaranteed delays and throughput fairness. In IEEE INFOCOM '97 (1997).
29. WALDSPURGER, C. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management, PhD thesis, Massachusetts Institute of Technology, 1995.
30. WWW.CISCO.COM. Cisco GSR.
31. XU, J., AND LIPTON, R. On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. In ACM SIGCOMM '02 (2002).
32. ZHANG, L. A New Architecture for Packet Switching Network Protocols. PhD thesis, Massachusetts Institute of Technology, 1989.
33. ZHANG, L. Virtual clock: A new traffic control scheme for packet switching networks. In ACM SIGCOMM '90 (1990).
34. ZHANG, L., DEERING, S., ESTRIN, D., SHENKER, S., AND ZAPPALA, D. RSVP: A new resource reservation protocol. IEEE Network (1993).