Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network


The KIPS Transactions:PartC, Vol. 9, No. 1, pp. 21-30, Feb. 2002
10.3745/KIPSTC.2002.9.1.21,   PDF Download:

Abstract

Nowadays the fair queuing field is studied actively for solving the unfair queuing problem which degrades the service performance of various applications on network. Above all DRR is a scheme that has lower work complexity and can be implemented easily. It guarantees the fair service by serving each queue every round Service Quantum(SQ) that includes the service deficit of the previous round. But it increases the delay by the numbers of unnecessary resetting of SQ or round circulation for the service that have the packet size over maximum several kbyte. In this paper, We propose the method that sets SQ dynamically to minimize this problem and the method that minimizes the work complexity on processing of packet. The proposed scheme minimizes the delay on various applications in enterprise environment by setting SQ dynamically and processing the packet simply.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. Y. Kim and Y. H. Youn, "Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network," The KIPS Transactions:PartC, vol. 9, no. 1, pp. 21-30, 2002. DOI: 10.3745/KIPSTC.2002.9.1.21.

[ACM Style]
Tai Yun Kim and Yeo Hoon Youn. 2002. Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network. The KIPS Transactions:PartC, 9, 1, (2002), 21-30. DOI: 10.3745/KIPSTC.2002.9.1.21.