Decoupling Bandwidth and Delay Properties in Class Based Queuing

Authors:
Affiliations:
Venue:
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Year:
2001

Citing 0
Cited 3

Implementation and Characterization of an Advanced Scheduler

ICN '01 Proceedings of the First International Conference on Networking-Part 1
Intelligent agents technology applied to tasks scheduling and communications management in a critical care telemonitoring system

Computers in Biology and Medicine
Fair bandwidth sharing using Shapley value

Proceedings of the 2008 Euro American Conference on Telematics and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.