Proceedings. Sixth IEEE Symposium on Computers and Communications
DOI: 10.1109/iscc.2001.935425
|View full text |Cite
|
Sign up to set email alerts
|

Decoupling bandwidth and delay properties in class based queuing

Abstract: This paper presents the Decoupled Class Based Scheduling, a CBQ-derived scheduling algorithm. Main advantages of D-CBQ are a new set of rules for distributing excess bandwidth and the ability to guarantee bandwidth and delay in a separate way, whence the name "decoupled"; moreover D-CBQ guarantees better delay bounds and more precise bandwidth assignment. This paper presents D-CBQ main points and discusses the choices for the implementation of the algorithm.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…is crucial with Weighted Round Robin and Class Based Queuing [19]), others that are specifically designed to provide guaranteed delay (e.g. Stop and Go queuing [20] or Jitter-EDD) and do not require over-allocation at all, and others that decouple bandwidth allocation and delay (Hierarchical Fair Service Curve [21] or Decoupled Class Based Queuing [22]).…”
Section: Delay Bound and Call Admission Controlmentioning
confidence: 99%
“…is crucial with Weighted Round Robin and Class Based Queuing [19]), others that are specifically designed to provide guaranteed delay (e.g. Stop and Go queuing [20] or Jitter-EDD) and do not require over-allocation at all, and others that decouple bandwidth allocation and delay (Hierarchical Fair Service Curve [21] or Decoupled Class Based Queuing [22]).…”
Section: Delay Bound and Call Admission Controlmentioning
confidence: 99%
“…An in-depth analysis of CBQ, on the other hand, shows several problems; most of them have been pointed out in [3] and [7]. This paper aims at the completion of [7] by summarizing the D-CBQ characteristics, presenting the implementation issues, and characterizing this new scheduler.…”
Section: Introductionmentioning
confidence: 99%
“…Except for some minor differences we were able to find all the required basic blocks. Basically, we needed hierarchical schedulers (we used the standard one in Cisco and D-CBQ [12] in ns-2 and FreeBSD), queue managers (WRED in Cisco and RIO 4 [16] in FreeBSD), marker/droppers and meters.…”
Section: On-field Experiencementioning
confidence: 99%