Decoupling bandwidth and delay properties in class based queuing
Fulvio Risso · 2002
This paper presents the decoupled class based scheduling, a CBQ-derived scheduling algorithm. The 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.