1999
DOI: 10.1145/505696.505702
|View full text |Cite
|
Sign up to set email alerts
|

Operational and performance issues of a CBQ router

Abstract: The use of scheduling mechanisms like Class Based Queueing (CBQ) is expected to play a key role in next generation multiservice IP networks. In this paper we attempt an experimental evaluation of ALTQ/CBQ demonstrating its sensitivity to a wide range of parameters and link layer driver design issues. We pay attention to several CBQ internal parameters that affect performance drastically and particularly to "borrowing", a key feature for flexible and efficient link sharing. We are also investigating cases where… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0
1

Year Published

2000
2000
2011
2011

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 6 publications
0
11
0
1
Order By: Relevance
“…Class-based WFQ (CBWFQ) extends the standard WFQ [1] functionality to provide support for user defined traffic classes. It also extends the packet round robin (PRR) in [37] and weighted round robin (WRR) in [38]. In [39], Millet and Mammeri derived the delay bound of a packet belonging to a regulated (r p i , ) flow and assigned the highest priority in CBWFQ network, where r represents the link capacity and p i the fraction of the link bandwidth that determines the amount of bandwidth reserved for class i.…”
Section: Class-based Queuingmentioning
confidence: 99%
“…Class-based WFQ (CBWFQ) extends the standard WFQ [1] functionality to provide support for user defined traffic classes. It also extends the packet round robin (PRR) in [37] and weighted round robin (WRR) in [38]. In [39], Millet and Mammeri derived the delay bound of a packet belonging to a regulated (r p i , ) flow and assigned the highest priority in CBWFQ network, where r represents the link capacity and p i the fraction of the link bandwidth that determines the amount of bandwidth reserved for class i.…”
Section: Class-based Queuingmentioning
confidence: 99%
“…For example, Class A queue may get 60% of link BW, Class B 30% and Class C 10% as shown inFigure 5.3. Some of the link sharing and scheduling algorithms include Class-Based Queuing[14],[20], Hierarchical-Fair Service Curve Algorithm[23],[21]. By allowing isolation between realtime and best effort traffic in cooperation with packet schedulingalgorithms that give priority to the real-time traffic, controlled link-sharing is a key component in enabling deployment of priority based packet scheduling algorithms designed to meet the end-to-end service requirements of real time traffic.…”
mentioning
confidence: 99%
“…The most common CBQ implementations 3 can be found in the ns-2 simulator and ALTQ tool, although both of them present some discrepancies from the original specification (some have been pointed out in [3]). However an in-depth analysis of the CBQ behavior shows some weakness that will be briefly pointed out.…”
Section: Cbq: An In-depth Analysismentioning
confidence: 99%