Abstract
Quality of Service (QoS) support for data flows typically requires the use of a scheduling algorithm. For better support of QoS, the scheduling algorithm should be able to provide an acceptable level of performance as well as the functionality required for different service models such as Integrated Services, Differentiated Services, and ATM. This functionality includes a perflow and an aggregated flow scheduling, shaping, priority, etc. In this paper, we described a new scheduling algorithm, Packet-size Based Queuing (PBQ) that supports the functionality in ways that are more efficient and flexible. The PBQ’s scheduling discipline with a hierarchical structure provides a hierarchical class based flow management, hierarchical shaping, and priority scheme all at the same time. The hierarchical shaping functionality, unlike other traditional shaping algorithms, shapes a group of flows (or classes) in an aggregated way while providing a proper scheduling to each flow (or class) in the group locally. The priority scheme in PBQ helps to reduce the worst delay bound, which becomes larger when priority index calculation is simplified. With all this functionality, the resulting scheduling algorithm has as a primary goal implementation simplicity while still maintaining an acceptable level of performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernnett, J. C. R., Zhang, H., “Hierarchical Packet Fair Queuing Algorithms, “ Proceedings of ACM SIGCOMM’ 96, August 1997.
Choi, M., “Traffic Flow Management for RSVP/ATM Edge Devices,” Ph.D. Thesis Georgia Institute of Technology, August 1999.
Floyd, S., Jacobson, V., “Link-sharing and Resource Management Models for Packet Network,” IEEE/ACM Transactions on Networking, Vol. 3 No. 4, pp. 365–386, August 1995.
Goyal, P., Vin, H. M., Chen, H., “Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks,” IEEE/ACM Transactions on Networking, Vol. 5, No. 5, October 1997.
Golestani, S. J., “A Self-Clocked Fair Queuing Scheme for Broadband Applications,” Proceedings IEEE INFOCOM’ 94. The Conference on Computer Communications. Networking for Global Communications, vol. 2, pp. 636–46, 1994.
Zhang, H., “Service Discipline for Guaranteed Performance Service in Packet-Switching Network,” Proceedings of the IEEE, vol. 83, no. 10, pp. 1374–96, October 1995.
Georgiadis, L., Guérin, R., Peris, V., Sivarajan, K. N., “Efficient Network QoS Provisioning Based on per Node Traffic Shaping”, IEEE/ACM Transactions on Networking, Vol. 4, No. 4, August 1996.
Georgiadis, L., Guérin, R., Peris, V. Rajan, R., “Efficient Support of Delay and Rate Guarantees in an Internet”, Computer Communication Review, vol.26, no.4, pp.106–16, October 1996.
Mil 3 OPNET Modeler, Models/Protocols Mil 3, 1997
Stiliadis, D., and Varma, A. “Design and Analysis of Frame-Based Fair Queuing: A New Traffic Scheduling Algorithm for Packet Switched Networks”, SIGMETRICS’96, pp. 104–115, 1996.
Quadros, G., Alves, A., Monteiro, E., Boavida, F., Tohme, S., Ulema, M., “How unfair can weighted fair queuing be?,” ISCC 2000, p. 779–84, July 2000.
Stoica, I., Zhang, H., Ng, T.S.E., “A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services,” IEEE/ACM Transactions on Networking, vol. 8, no. 2, April 2000
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, M.C., Owen, H.L., Sokol, J. (2001). Packet-Size Based Queuing Algorithm for QoS Support. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive