Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm 


Vol. 37,  No. 6, pp. 405-413, Jun.  2012


PDF
  Abstract

WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O(N2).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

  Statistics
Cumulative Counts from November, 2022
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. Kim and B. Suh, "Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 6, pp. 405-413, 2012. DOI: .

[ACM Style]

Tae-joon Kim and Bongsue Suh. 2012. Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 37, 6, (2012), 405-413. DOI: .

[KICS Style]

Tae-joon Kim and Bongsue Suh, "Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 6, pp. 405-413, 6. 2012.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880