Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Performance of a Linux implementation of class based queueing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Loh, K.J. ; Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore ; Gui, I. ; Chua, K.C.

Class based queueing (CBQ) is a link-sharing and resource management mechanism for packet networks. We have ported the CBQ implementation on FreeBSD, also known as alternate queueing (ALTQ), to the Linux platform. This paper investigates the performance of CBQ in terms of latency, bandwidth guarantee and delay. CBQ is found to be able to preserve bandwidth allocated to the classes. However it does not scale well with the number of data flows as it incurs additional delay with each new data flow admitted. Due to this additional delay, the admission control cannot predict the delay experienced by the existing flows after admitting a new flow. Although CBQ is able to provide lower delay to higher priority flows, it also introduces jitter to the traffic owing to its packet scheduling artifact. As such, CBQ is not suitable for fine-grained scheduling of real-time traffic. It is more suited for providing bandwidth guarantee to aggregated data flows

Published in:

Computer Communications and Networks, 1998. Proceedings. 7th International Conference on

Date of Conference:

12-15 Oct 1998