SRR: An O(1) time-complexity packet scheduler for flows in multiservice packet networks

IEEE/ACM Transactions on Networking

Volumn 12, Issue 6, 2004, Pages 1144-1155

  Guo, Chuanxiong ^a  

^a INSTITUTE OF COMMUNICATIONS ENGINEERING   (China)

Author keywords

End to end delay; Fair queueing; High speed networks; Packet scheduling; Time complexity

Indexed keywords

COMPUTER SIMULATION; MATRIX ALGEBRA; QUALITY OF SERVICE; QUEUEING THEORY; THEOREM PROVING; VECTORS;

END-TO-END DELAY; FAIR QUEUEING; GENERALIZED PROCESSOR SHARING; HIGH SPEED NETWORKS; PACKET SCHEDULING; TIME COMPLEXITY;

PACKET NETWORKS;

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

References (33)

1. 2Q: Worst-case fair weighted fair queueing," in Proc. INFOCOM, 1996, pp. 120-128.
2. J. Bennet and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. SIGCOMM, 1996, pp. 143-156.
3. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An architecture for differentiated services, in RFC 2475, Dec. 1998.
4. J. Bolot and T. Turletti, "Experience with control mechanisms for packet video," Computer Commun. Rev., vol. 28, no. 1, pp. 4-15, June 1998.
5. D. Clark and W. Fang, "Explicit allocation of best-effort packet delivery service," IEEE/ACM Trans. Networking, vol. 6, pp. 362-373, Aug. 1998.
6. D. Clark, "The design philosophy of the DARPA Internet protocols," in Proc. SIGCOMM, 1988, pp. 106-114.
7. D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: architecture and mechanism," in Proc. SIGCOMM, 1992, pp. 14-26.
8. J. Cobb, M. Gouda, and A. El-Nahas, "Time, shift scheduling - fair scheduling of flows in high-speed networks," IEEE/ACM Trans. Networking, vol. 6, pp. 274-285, June 1998.
9. J. Cobb, M. Gouda, and A. El-Nahas, "Flow theory," IEEE/ACM Trans. Networking, vol. 5, pp. 661-674, Oct. 1997.
10. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. SIGCOMM, 1989, pp. 1-12.
11. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
12. S. Floyd and V. Jacobson, "Link-share and resource management models for packet networks," IEEE/ACM Trans. Networking, vol. 3, pp. 365-386, Aug. 1995.
13. S. Floyd and K. Fall, "Promoting the use of end-to-end congestion control in the Internet," IEEE/ACM Trans. Networking, vol. 7, pp. 458-472, Aug. 1999.
14. L. Georgiadis, R. Guerin, and R. Rajan, "Efficient support of delay and rate Guarantees in an Internet," in Proc. SIGCOMM, 1996, pp. 106-116.
15. P. Goyal, H. M. Vin, and H. Cheng, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," IEEE/ACM Trans. Networking, vol. 5, pp. 690-704, 1997.
16. P. Goyal and H. Vin, "Generalized guaranteed rate scheduling algorithms: A framework," IEEE/ACM Trans. Networking, vol. 5, pp. 561-571, Aug. 1997.
17. C. Guo, "A SRR packet scheduler for flows in multi-service packet networks," Ph.D. dissertation, Inst. of Comm. Eng. of China, Apr. 2000.
18. S. R. McCanne, "Scalable compression and transmission of internet multicast video," Ph.D. dissertation, Univ. California, Berkeley, Dec. 1996.
19. A. Parekh, "A generalized processor sharing approach to flow control in integrated services network," Ph.D. dissertation, Dept. Elect. Eng. and Comput. Sci., M.I.T., Cambridge, Feb. 1992.
20. V. Paxson and S. Floyd. Why We Don't Know How to Simulate the Internet. [Online] ftp://ftp.ee.lbl.gov/papers/wsc97.ps
21. O. Rose, "Traffic modeling of variable bit rate MPEG video and its impacts on ATM networks," Ph.D. dissertation, Univ. of Wurezburger, Bericht, Germany, Feb. 1997.
22. D. Saha, S. Mukherjee, and S. Tripathi, "Carry-over round robin: a simple cell scheduling mechanism for ATM networks," IEEE/ACM Trans. Networking, vol. 6, pp. 779-796, Dec. 1998.
23. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin," in Proc. SIGCOMM, 1995, pp. 231-242.
24. D. Stiliadis and A. Varma, "Rate-proportional servers: A design methodology for fair queueing algorithms," IEEE/ACM Trans. Networking, vol. 6, pp. 164-174, Apr. 1998.
25. D. Stiliadis and A. Varma, "Efficient fair queueing algorithms for packet-switched networks," IEEE/ACM Trans. Networking, vol. 6, pp. 175-185, Apr. 1998.
26. A. Varma and D. Stiliadis, "Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks," IEEE Commun. Mag., vol. 35, pp. 54-68, Dec. 1997.
27. The VINT Project NS Notes and Documentation. [Online] http://www-mash. cs.berkeley.edu/ns/nsDoc.ps.gz
28. J. Wang, "Study and Implementation of Packet Schedulers for DiffServ," Master thesis, Inst. of Comm. Eng. of China, Mar. 2001.
29. W. Weiss, "QoS with differentiated services," Bell-Labs Tech. J. vol. 3, no. 4, pp. 48-62, Oct.-Dec. 1998.
30. W. Willingers and V. Paxson, "Where mathematics meets the Internet," Notes Amer. Math. Soc., vol. 45, pp. 961-970, Aug. 1998.
31. J. Xu and R. Lipton, "On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms," in Proc. SIGCOMM, 2002, pp. 279-292.
32. L. Zhang, "A new architecture for packet switching network protocols," Ph.D. dissertation, Dept. Elect. Eng. and Comput Sci., M.I.T., Cambridge, Aug. 1989.
33. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A new Resource ReServation Protocol," IEEE Network, vol. 7, pp. 8-18, Sept. 1993.