Abstract
Because of their minimal complexity,Weighted Round Robin (WRR) schedulers have become a popular solution for providing bandwidth guarantees to IP flows in emerging networks that support differentiated services. The introduction of applications that require flexible bandwidth management puts emphasis on hierarchical scheduling structures, where bandwidth can be allocated not onlyto individual flows, but also to aggregations of those flows. With existing WRR schedulers, the superimposition of a hierarchical structure compromises the simplicity of the basic scheduler. Another undesirable characteristic of existing WRR schedulers is their burstiness in distributing service to the flows. In this paper, we present two enhancements for WRR schedulers which solve these problems. In the first enhancement, we superimpose a hierarchical structure bys implyre defining the way the WRR scheduler computes the timestamps of the flows. This “soft” hierarchyh as negligible complexity, since it does not require any additional scheduling layer, yet is highly effiective. The second enhancement defines an implementation of a WRR scheduler that substantiallyre duces the service burstiness with marginal additional complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Stiliadis and A. Varma, “Design and Analysis of Frame-based Fair Queueing: A New Traffic Scheduling Algorithm for Packet-Switched Networks,” Proceedings of ACM SIGMETRICS’ 96, pp. 104–115, May 1996.
D. Stiliadis and A. Varma, “Latency-rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms,” IEEE INFOCOM’ 96, pp. 111–119, March 1996.
J. C. R. Bennett and H. Zhang, “Hierarchical Packet Fair Queueing Algorithms,” Proceedings of ACM SIGCOMM’ 96, pp. 143–156, August 1996.
I. Stoica, H. Zhang, and T. S. E. Ng, “A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and PrioritySe rvices,” Proceedings of ACM SIGCOMM’ 97, September 1997.
D. C. Stephens, J. C. R. Bennett, and H. Zhang, “Implementing Scheduling Algorithms in High-Speed Networks,” IEEE Journal on Selected Areas in Communications, Vol. 17, No. 6, June 1999, pp. 1145–1158.
M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, “Weighted Round Robin Cell Multiplexing in a General-Purpose ATM Switch,” IEEE Journal on Selected Areas in Communications, vol. 9, pp. 1265–79, October 1991.
M. Shreedhar and G. Varghese, “Efficient Fair Queueing Using Deficit Round Robin,” IEEE/ACM Transactions on Networking, vol. 4, no. 3, pp. 375–385, June 1996.
H. Adiseshu, G. Parulkar, and G. Varghese, “A Reliable and Scalable Striping Protocol,” Proceedings of ACM SIGCOMM’ 96, August 1996.
A. K. Parekh and R. G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Transactions on Networking, pp. 344–357, June 1993.
L. Zhang, “Virtual Clock: A New Traffic Control Algorithm for Packet Switching,” ACM Transactions on Computing Systems, pp. 101–124, May 1991.
S. J. Golestani, “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” Proceedings of IEEE INFOCOM’ 94, pp. 636–646, April 1994.
P. Goyal, H. M. Vin, and H. Chen, “Start-time Fair Queueing: A Scheduling Algorithm for Integrated Services,” ACM SIGCOMM’ 96, pp. 157–168, August 1996.
J. L. Rexford, A. G. Greenberg, and F. G. Bonomi, “Hardware-Efficient Fair Queueing Architectures for High-Speed networks,” Proceedings of IEEE INFOCOM’ 96, pp. 638–646, March 1996.
J. L. Rexford, A. G. Greenberg, F. G. Bonomi, and A. Wong, “Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 5, pp. 938–950, June 1997.
H. J. Chao and J. S. Hong, “Design of an ATM Shaping Multiplexer with Guaranteed Output Burstiness,” Computer Systems Science and Engineering, vol. 12, no. 2, March 1997.
F. M. Chiussi, A. Francini, and J. G. Kneuer, “Implementing Fair Queueing in ATM Switches-Part 2: The Logarithmic Calendar Queue,” Proceedings of IEEE GLOBECOM’ 97, pp. 519–525, November 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Francini, A., Chiussi, F.M., Clancy, R.T., Drucker, K.D., Idirene, N.E. (2001). Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks. In: Marsan, M.A., Bianco, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2001. Lecture Notes in Computer Science, vol 1989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44554-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-44554-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41512-1
Online ISBN: 978-3-540-44554-8
eBook Packages: Springer Book Archive