Effective Scalable Caching Algorithm by Minimizing Normalized Buffer Size over Constant-Bit-Rate Channel 


Vol. 30,  No. 8, pp. 535-540, Aug.  2005


PDF
  Abstract

This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client’s buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client’s buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as well as the frame size. Based on this fact, we propose an effective caching algorithm to select the cached frames by using the normalized buffer size. Finally, experimental results are provided to show the superior performance of the proposed algorithm.

  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. Oh and H. Song, "Effective Scalable Caching Algorithm by Minimizing Normalized Buffer Size over Constant-Bit-Rate Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 535-540, 2005. DOI: .

[ACM Style]

HyungRai Oh and Hwangjun Song. 2005. Effective Scalable Caching Algorithm by Minimizing Normalized Buffer Size over Constant-Bit-Rate Channel. The Journal of Korean Institute of Communications and Information Sciences, 30, 8, (2005), 535-540. DOI: .

[KICS Style]

HyungRai Oh and Hwangjun Song, "Effective Scalable Caching Algorithm by Minimizing Normalized Buffer Size over Constant-Bit-Rate Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 535-540, 8. 2005.