Delay Performance of Multi-Service Network with Strict Priority Scheduling Scheme 


Vol. 30,  No. 2, pp. 11-20, Feb.  2005


PDF
  Abstract

Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also known that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

  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. Lee, "Delay Performance of Multi-Service Network with Strict Priority Scheduling Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 11-20, 2005. DOI: .

[ACM Style]

Hoon Lee. 2005. Delay Performance of Multi-Service Network with Strict Priority Scheduling Scheme. The Journal of Korean Institute of Communications and Information Sciences, 30, 2, (2005), 11-20. DOI: .

[KICS Style]

Hoon Lee, "Delay Performance of Multi-Service Network with Strict Priority Scheduling Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 11-20, 2. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880