Efficient and fair hierarchical packet scheduling using dynamic deficit round robin

Abstract

This paper proposes a new hierarchical packet scheduling algorithm, HDDRR, enhanced from the existing dynamic deficit round-robin (DDRR) to provide relative differentiated service that enables support of delay-sensitive applications over the Internet. The level of service differentiation can be adjusted with parameter. The HDDRR scheduler fully utilizes the property of DDRR, therefore it can achieve high throughput efficiently and simultaneously provide smaller delay for short packets of each class. Simulation results showing the effectiveness of HDDRR are also presented.

Extracted Key Phrases

13 Figures and Tables

Cite this paper

@inproceedings{Wu2005EfficientAF, title={Efficient and fair hierarchical packet scheduling using dynamic deficit round robin}, author={Chin-Chi Wu and Chiou Moh and Hsien-Ming Wu and Ding-Jyh Tsaur and Woei Lin}, booktitle={Communications and Computer Networks}, year={2005} }