Credit-Based Round Robin for High Speed Networks 


Vol. 27,  No. 12, pp. 1207-1214, Dec.  2002


PDF
  Abstract

A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks suppon a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of 0(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these propenies, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.

  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]

H. S. Nam, H. S. Lee, H. H. Lee, D. Y. Kim, "Credit-Based Round Robin for High Speed Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1207-1214, 2002. DOI: .

[ACM Style]

Hong Soon Nam, Heyung Sub Lee, Hyeong HO Lee, and Dea Young Kim. 2002. Credit-Based Round Robin for High Speed Networks. The Journal of Korean Institute of Communications and Information Sciences, 27, 12, (2002), 1207-1214. DOI: .

[KICS Style]

Hong Soon Nam, Heyung Sub Lee, Hyeong HO Lee, Dea Young Kim, "Credit-Based Round Robin for High Speed Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1207-1214, 12. 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