Abstract
In the egress linecards of very high-speed Internet routers, packet schedulers must possess extremely low computation complexity and be able to handle flows of variable-length packets. Existing examples of such schedulers include deficit round-robin (DRR). In addition, it may be desirable to limit the variation about the peak-rate of certain egress flows (e.g., those under expedited forwarding (EF) service) so that their packets are not deemed out-of-profile downstream or possibly dropped as a result. Based on Shaped Weighted Round-Robin (SWRR), we propose a scheduler called Shaped Deficit Round-Robin (SDRR) and prove that it strictly limits the variation about the allocated peak-rate of every output flow. As such, our proposed SDRR is suitable for the modern Internet routers of a differentiated-service/MPLS.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.C.R. Bennett and H. Zhang. Hierarchical packet fair queueing algorithms, IEEE/ACM Transactions on Networking 5(5) (1997) 675-689.
G. Chuanxiong, Leap SRR: An O(1) time complexity packet scheduler for a flows in multi-sevice packet network. in: Proc. of IEEE SIGCOMM, San Diego, 2001, pp. 211-222.
L. Georgiadis, R. Guerin, V. Peris and K.N. Sivarajan, Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking 4(4) (1996) 482-501.
J. Heinanen, T. Finland and R. Guerin, A single rate three color marker, RFC 2697, available at www.ietf.org (1999).
G. Kesidis, ATM Network Performance, 2nd ed. (Kluwer Academic, Boston, 1999).
G. Kesidis, Scalable resources management using shaped weighted round-robin scheduling, in: Proc. of SPIE ITCOM, Denver, 2001.
M.H. MacGregor and W. Shi, Deficits for bursty latency-critical flows: DRR++, in: Proc. of IEEE Internat. Conf. on Networks (ICON), 2000, pp. 287-293.
A.K. Parekh and R.G. Gallager, generalized processor sharing approach to flow control in integrated services networks: The single node case, IEEE/ACM Transactions on Networking 1(5) (1993) 344-357.
Q&A: How can I generate traffic representative of ‘Realistic’ Internet traffic?, Agilent Technologies, available at http://advanced.comms.agilent.com/insight/2001-08/ Questions/traffic_gen.htm (2001).
J.L. Rexford, A.G. Greenberg and F.G. Bonomi, Hardware-efficient fair queueing architectures for high-speed networks, in: Proc. of IEEE INFOCOM, San Francisco, 1996, pp. 638-646.
J. Rexford, F. Bonomi, A. Greenberg and A.Wong, Scalable architectures for integrated traffic shaping and link scheduling in high-speed ATMswitches, IEEE Journal on Selected Areas in Communications 15(5) (1997) 938-950.
D. Saha, D. Mukherjee and S.K. Tripathi, Carry-over round robin: A simple cell scheduling mechanism for ATM networks, IEEE/ACM Transactions on Networking 6(6) (1998) 779-796.
S. Suri, G. Varghese and G. Chandranmenon, Efficient fair queueing using deficit round-robin, IEEE/ACM Transactions on Networking 4(3) (1996) 375-385.
S. Suri, G. Varghese and G. Chandranmenon, Leap forward virtual clock: A new fair queueing scheme with guaranteed delays and throughput fairness, in: Proc. of IEEE INFOCOM, Kobe, 1997, pp. 558-566.
D. Stiliadis and A. Varma, A general methodology for designing efficient traffic scheduling and shaping algorithms, in: Proc. of IEEE INFOCOM, Kobe, 1997 pp. 326-335.
H. Zhang, Service disciplines for guaranteed performance service in packet-switching networks, Proceedings of the IEEE 83(10) (1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiwasurat, S., Kesidis, G. A Class of Shaped Deficit Round-Robin (SDRR) Schedulers. Telecommunication Systems 25, 173–191 (2004). https://doi.org/10.1023/B:TELS.0000014780.33289.ad
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000014780.33289.ad