Bandwidth Utilization in Latency-Optimized Fair Queuing Algorithm 


Vol. 14,  No. 2, pp. 155-162, Apr.  2007
10.3745/KIPSTC.2007.14.2.155


PDF
  Abstract

WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poor bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone. It was recently identified that the poor utilization is mainly due to non-optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome thedrawback was introduced. LOFQ was also improved through introducing an occupied resource optimization function and the implementation complexity of recursive resource transformation was reduced with revising the transformation scheme. However, the performance of LOFQ has been evaluated by means of simulation, so that there are some difficulties in evaluating the performance in the terms of the accuracyand evaluation time. In this paper, we develop how to analytically compute the bandwidth utilization in LOFQ.

  Statistics
  Cite this article

[IEEE Style]

T. J. Kim, "Bandwidth Utilization in Latency-Optimized Fair Queuing Algorithm," The KIPS Transactions:PartC, vol. 14, no. 2, pp. 155-162, 2007. DOI: 10.3745/KIPSTC.2007.14.2.155.

[ACM Style]

Tae Joon Kim. 2007. Bandwidth Utilization in Latency-Optimized Fair Queuing Algorithm. The KIPS Transactions:PartC, 14, 2, (2007), 155-162. DOI: 10.3745/KIPSTC.2007.14.2.155.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals