Please use this identifier to cite or link to this item:

Vertical dimensioning: A novel DRR implementation for efficient fair queueing

Authors Bakiras, Spiridon HKUST affiliated (currently or previously)
Wang, Feng
Papadias, Dimitris View this author's profile
Hamdi, Mounir View this author's profile
Issue Date 2008
Source Computer communications , v. 31, (14), 2008, SEP 5, p. 3476-3484
Summary Fair bandwidth allocation is an important mechanism for traffic management in the Internet. Round robin schedulers, such as Deficit Round Robin (DRR), are well-suited for implementing fair queueing in multi-Gbps routers, as they schedule packets in constant time regardless of the total number of active flows. The main drawback of these schemes, however, lies in the maintenance of per flow queues, which complicates the buffer management module and limits the sharing of the buffer space among the competing flows. In this paper, we introduce a novel packet scheduling mechanism, called Vertical Dimensioning (VD) that modifies the original DRR algorithm to operate without per flow queueing. In particular, VD is based on an array of FIFO buffers, whose size is constant and independent of the total number of active flows. Our results, both analytical and experimental, demonstrate that VD exhibits very good fairness and delay properties that are comparable to the ideal Weighted Fair Queueing (WFQ) scheduler. Furthermore, our scheduling algorithm is shown to outperform significantly existing round robin schedulers when the amount of buffering at the router is small. (C) 2008 Elsevier B.V. All rights reserved.
ISSN 0140-3664
Rights Computer Communications © copyright (2008) Elsevier. The Journal's web site is located at
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
CC08-VD.pdf 146818 B Adobe PDF