Abstract
Class Based Queueing (CBQ) is a packet scheduling discipline that enables hierarchical link-sharing. Compared to other algorithms, it is modular and intuitive in a first approach, and so is implemented and used nowadays. In this paper, we adapt the discipline to schedule critical real-time flows mixed with other kinds of traffic, as is necessary in a DiffServ environment. This requires that some guarantees must be provided deterministically, particularly on queueing delay bounds. Yet theoretical delay bounds for CBQ were never expressed in a general case and with end-to-end derivation, because the nesting of mechanisms makes it hard to predict a worst case scenario. Here we study some cases where an analysis is possible, focusing on two variants of CBQ, and we use network calculus technique to set up a bound that seems realistic. We then show simulations to check the precision of our results.
This is a preview of subscription content, log in via an institution to check access.
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
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Service, RFC2475 (1998)
Floyd, S., Jacobson, V.: Link Sharing and Resource Management Models for Packet Networks. IEEE/ACM Transactions on Networking (1995)
Bennett, J.C.R., Zhang, H.: Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Transactions on Networking 5, 675–689 (1997)
Stoica, I., Zhang, H., Ng, T.S.E.: A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services. SIGCOMM (1997)
Risso, F., Gevros, P.: Operational and Performance Issues of a CBQ router. ACM SIGCOM Computer Communication Review (1999)
Risso, F.: Decoupling Bandwidth and Delay Properties in Class Based Queueing. In: Proceedings of the 6th IEEE Symposium on Computers and Communications (2001)
Floyd, S., Speer, M.F.: Experimental Results for Class-Based Queueing (1998) (Paper in progress)
Cho, K.: A Framework for Alternate Queueing: Towards Traffic Management by PC-UNIX Based Routers. In: USENIX Annual Technical Conference (1998)
Floyd, S.: Notes on CBQ and Guaranteed Service. Draft document (1995)
Millet, A., Mammeri, Z.: WFQ-based CBQ Discipline: an Approach to Provide QoS Guarantees in Networks. In: SCI 2003, Orlando, Florida (2003)
Demers, A., Keshav, S.: Analysis and Simulation of a Fair Queueing Algorithm. In: ACM SIGCOMM Computer Communication Review, Symposium proceedings on Communications architectures and protocols, vol. 19 (1989)
Floyd, S.: Notes on Class-Based Queueing: Setting Parameters. Informal notes (1996)
Le Boudec, J.Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2002)
The Network Simulator NS-2 Home Page (2004), http://www.isi.edu/nsnam/ns/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Millet, A., Mammeri, Z. (2004). Packet Delay Analysis under Class Based Queueing. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive