HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >

Please use this identifier to cite or link to this item:
Title: Vertical dimensioning: a novel DRR implementation for efficient fair queueing
Authors: Bakiras, Spiridon
Wang, Feng
Papadias, Dimitris
Hamdi, Mounir
Keywords: Packet scheduling
Fair queueing
Deficit Round Robin
Issue Date: 2008
Citation: Computer Communications, v. 31, no. 14, September 2008, p. 3476-3484
Abstract: 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.
Rights: Computer Communications © copyright (2008) Elsevier. The Journal's web site is located at
Appears in Collections:CSE Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
CC08-VD.pdfpre-published version143KbAdobe PDFView/Open

Find published version via OpenURL Link Resolver

All items in this Repository are protected by copyright, with all rights reserved.