This paper presents a dynamic and scalable caching algorithm for proxy servers with a finite storage size. Under a 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 proposed an effective scalable caching algorithm to select the cached frames by using the normalized buffer size. The obtained data are saved into the metafile. Now, we study the caching and replacing algorithms for multiple videos that are based on the metafile and effectively reduce both the buffer size and the required bandwidth. Finally, experimental results are provided to show the superior performance of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Oh, H. R., & Song, H. (2005). Dynamic and scalable caching algorithm of proxy server for multiple videos. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3768 LNCS, pp. 24–35). https://doi.org/10.1007/11582267_3
Mendeley helps you to discover research relevant for your work.