An Optimal parameter selection Algorithm for standard-compatible traffic descriptors for multimedia traffic 


Vol. 30,  No. 5, pp. 370-375, May  2005


PDF Full-Text
  Abstract

While the international standards bodies recommend the dual leaky buckets for the traffic specification for VBR service, video traffic shows burstiness in multiple time-scales. In order to fill this gap between the current standards and real traffic characteristics, we present a standard-compatible traffic parameter selection method based on the notion of a critical time scale (CTS). Since the defined algorithm minimizes the required link capacity under a maximum delay constraint, it could be used as a benchmark even when it can not be implemented easily. Simulation results with compressed video traces demonstrate the efficiency of the defined traffic parameter selection algorithm in resource allocation.

  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. Ahn and H. Oh, "An Optimal parameter selection Algorithm for standard-compatible traffic descriptors for multimedia traffic," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 370-375, 2005. DOI: .

[ACM Style]

Heejune Ahn and Hyukjun Oh. 2005. An Optimal parameter selection Algorithm for standard-compatible traffic descriptors for multimedia traffic. The Journal of Korean Institute of Communications and Information Sciences, 30, 5, (2005), 370-375. DOI: .

[KICS Style]

Heejune Ahn and Hyukjun Oh, "An Optimal parameter selection Algorithm for standard-compatible traffic descriptors for multimedia traffic," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 370-375, 5. 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