Packet scheduling algorithm for guaranteed bound and firewall property of delay performance 


Vol. 27,  No. 5, pp. 435-444, May  2002


PDF
  Abstract

In this paper, a novel packet scheduling algorithm, so-called the CSL algorithm is discussed, whereby the
firewall property as well as the deterministic delay bound guarantee are supported in session level. Lots of simulation studies validate those properties of the CSL algorithm. The CSL algorithm is distingushable from the well- known EDD scheme in terms of the firewall property. Regarding the implementation complexity, the CSL algorithm turns out to be of O(1) besides the sorting overhead. Owing to the maintained generic fair queueing structure in the CSL algorithm, a various fair queueing schemes can be applied with minor modification. For the TCP/lP network which is vulnerable to the misbehaving traffic sources, the firewall property of the CSL algorithm is quite useful for the advanced quality of services.

  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]

D. Jeong, "Packet scheduling algorithm for guaranteed bound and firewall property of delay performance," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 435-444, 2002. DOI: .

[ACM Style]

Daein Jeong. 2002. Packet scheduling algorithm for guaranteed bound and firewall property of delay performance. The Journal of Korean Institute of Communications and Information Sciences, 27, 5, (2002), 435-444. DOI: .

[KICS Style]

Daein Jeong, "Packet scheduling algorithm for guaranteed bound and firewall property of delay performance," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 435-444, 5. 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