Please use this identifier to cite or link to this item:
Title: Low computational complexity weighted queuing using weighted deficit round robin
Authors: Wong, MYL
Li, CK
Keywords: Queuing
Issue Date: 2002
Source: Proceedings of the 20th IASTED International Multi-Conference in Applied Informatics (AI'2002), Innsbruck, Austria, February 2002, p. 285-288 How to cite?
Abstract: A modified Deficit Round Robin Queuing Algorithm, which can be applied in weighted Quality of Service (QoS) enabled network node, is proposed. The proposed Weighted Deficit Round Robin (WDRR) algorithm uses a simple mechanism to provide the weighted control in the nodes. The weight sharing ability of the algorithm remains comparable to the Weighted Fair Queuing (WFQ) and the Worst-case Fair Weighted Fair Queuing Plus (WF2 Q+) algorithms. The computational complexity of the proposed algorithms is, however, lower than both the WFQ and the WF2 Q+, yet provides a fair queuing among different flows in a Constant Bit Rate TCP traffic condition. The proposed algorithm is preferred one to implement weighted QoS in practical network nodes. Weighted Deficit Round Robin can provide fair queueing among different flows in the Constant Bit Rate TCP traffic condition. It is a good choice to enable QoS with weighted function in the network node.
Appears in Collections:Conference Paper

Show full item record

Page view(s)

Last Week
Last month
Citations as of Jul 10, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.