A Computationally-Efficient of Fair Queueing without Maintaining the System Virtual Time 


Vol. 27,  No. 9, pp. 836-841, Sep.  2002


PDF
  Abstract

Packet scheduling is an essential function to gurantee a quality of service by differentiating services inthe Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair Queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

  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]

J. Y. Lee and S. H. Rhee, "A Computationally-Efficient of Fair Queueing without Maintaining the System Virtual Time," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 836-841, 2002. DOI: .

[ACM Style]

Jun Yeop Lee and Seung Hyong Rhee. 2002. A Computationally-Efficient of Fair Queueing without Maintaining the System Virtual Time. The Journal of Korean Institute of Communications and Information Sciences, 27, 9, (2002), 836-841. DOI: .

[KICS Style]

Jun Yeop Lee and Seung Hyong Rhee, "A Computationally-Efficient of Fair Queueing without Maintaining the System Virtual Time," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 836-841, 9. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880