The Stratified Round Robin scheduler: Design, analysis and implementation

IEEE/ACM Transactions on Networking

Volumn 14, Issue 6, 2006, Pages 1362-1373

  Ramabhadran, Sriram ^a   Pasquale, Joseph ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

High speed router design; Packet scheduling; Quality of service

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DELAY CONTROL SYSTEMS; ROUTERS; SCHEDULING;

HIGH-SPEED ROUTER DESIGN; PACKET SCHEDULING;

PACKET SWITCHING;

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

References (33)

1. J. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. ACM SIGCOMM '96, Stanford, CA, Aug. 1996, pp. 143-156.
2. 2Q: worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM 1996, pp. 120-128.
3. S. Blake et al., "An architecture for diffrentiated services," RFC 2475, 1998.
4. W. Chan and J. Nieh, "Group ratio round-robin: An O(1) proportional share scheduler," Dept. Comput. Sci., Columbia Univ., New York, Tech. Rep. CUCS-012-03, Apr. 2003.
5. S. Cheung and C. Pencea, "BSFQ: Bin Sort Fair Queueing" in Proc. IEEE INFOCOM 2002, pp. 1640-1649.
6. G. Chuanxiong, "SRR, an O(1) time complexity packet scheduler for flows in multi-service packet networks," in Proc. ACM SIGCOMM 2001, San Diego, CA, Aug. 2001, pp. 211-222.
7. D. Clark, "The design philosophy of DARPA Internet protocols," in Proc. ACM SIGCOMM '88, pp. 106-114.
8. D. Clark and W. Fang, "Explicit allocation of best-effort packet delivery service," IEEE/ACM Trans. Netw., vol. 6, no. 4, pp. 362-373, Aug. 1998.
9. D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: architecture and mechanism," in Proc. ACM SIGCOMM '92, pp. 14-26.
10. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair-queueing algorithm," in Proc. ACM SIGCOMM '89, pp. 1-12.
11. N. Figueira and J. Pasquale, "Leave-in-time: a new service discipline for real-time communications in a packet-switching network," in Proc. ACM SIGCOMM '95, pp. 207-218.
12. _, "An upper bound delay for the virtual-clock service discipline," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 399-408, Aug. 1995.
13. _, "A schedulability condition for deadline-ordered service disciplines," IEEE/ACM Trans. Netw., vol. 5, no. 2, pp. 232-244, Apr. 1997.
14. S. Floyd and K. Fall, "Promoting the use of end-to-end congestion control in the Internet," IEEE/ACM Trans. Netw., vol. 7, no. 4, pp. 458-472, Aug. 1999.
15. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Netw., vol. 1, no. 4, pp. 397-413, Aug. 1993.
16. _, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 365-386, Aug. 1995.
17. S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM 1994, pp. 636-646.
18. P. Goyal and H. Vin, "Generalized guaranteed rate scheduling algorithms: a framework," IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 561-571, Aug. 1997.
19. L. Lenzini, E. Mingozzi, and G. Stea, "Aliquem: a novel DRR implementation to achieve better latency and fairness at O(1) complexity," in Proc. 10th Int. Workshop on Quality of Service (IWQoS 2002), pp. 77-86.
20. P. McKenney, "Stochastic fair queueing," Internetworking: Research and Experience, vol. 2, Jan. 1991.
21. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: the single-node case," IEEE/ACM Trans. Netw., vol. 1, no. 3, pp. 344-357, Jun. 1993.
22. J. Rexford, A. Greenberg, and F. Bonomi, "Hardware-efficient fair queueing architectures for high-speed networks," in Proc. IEEE INFOCOM 1996, pp. 638-646.
23. D. Saha, S. Mukherjee, and S. K. Tripathi, "Carry-over round robin: a simple cell scheduling mechanism for ATM networks," IEEE/ACM Trans. Netw., vol. 6, no. 6, pp. 779-796, Dec. 1998.
24. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. ACM SIGCOMM '95, pp. 231-242.
25. D. Stephens, J. Bennett, and H. Zhang, "Implementing scheduling algorithms in high-speed networks," IEEE J. Sel. Areas Commun., Special Issue on Next-Generation IP Switches and Routers, vol. 17, no. 6, pp. 1145-1158, Jun. 1999.
26. D. Stiliadis and A. Varma, "Efficient fair queueing algorithms for packet-switched networks," IEEE/ACM Trans. Netw., vol. 6, no. 2, pp. 175-185, Apr. 1998.
27. _, "Rate-proportional servers: a design methodology for fair queueing algorithms," IEEE/ACM Trans. Netw., vol. 6, no. 2, pp. 164-174, Apr. 1998.
28. 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 1997, pp. 557-565.
29. C. Waldspurger, "Lottery and stride scheduling: Flexible proportional-share resource management," Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA, 1995.
30. J. Xu and R. Lipton, "On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms," in Proc. ACM SIGCOMM 2002, Pittsburgh, PA, pp. 279-292.
31. L. Zhang, "A new architecture for packet switching network protocols," Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA, 1989.
32. _, "Virtual Clock: A new traffic control algorithm for packet switching networks," in Proc. ACM SIGCOMM '90, Philadelphia, PA, pp. 19-29.
33. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: a new Resource ReSerVation Protocol," IEEE Network, vol. 7, no. 5, pp. 8-18, Sep. 1993.