Efficient Packet Scheduling Algorithm using Virtual Start Time for High-Speed Packet Networks 


Vol. 28,  No. 3, pp. 171-182, Mar.  2003


PDF
  Abstract

In this paper, we propose an efficient and simple fair queueing algorithm, called Minimum Possible Virtual Start Time Fair Queueing (MPSFQ), which has O(1) complexity for the virtual time computation while it has good delay and fairness properties. The key idea of MPSFQ is that it has an easy system virtual time recalibration method while it follows a rate-proportional property. MPSFQ algorithm recalibrates system virtual time to the minimum possible virtual start time of all backlogged sessions. We will show our algorithm has good delay and fairness properties by analysis.

  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]

N. Ko and D. Kwak, "Efficient Packet Scheduling Algorithm using Virtual Start Time for High-Speed Packet Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 3, pp. 171-182, 2003. DOI: .

[ACM Style]

Nam-Seok Ko and Dong-Yong Kwak. 2003. Efficient Packet Scheduling Algorithm using Virtual Start Time for High-Speed Packet Networks. The Journal of Korean Institute of Communications and Information Sciences, 28, 3, (2003), 171-182. DOI: .

[KICS Style]

Nam-Seok Ko and Dong-Yong Kwak, "Efficient Packet Scheduling Algorithm using Virtual Start Time for High-Speed Packet Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 3, pp. 171-182, 3. 2003.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880