To search, Click below search items.


All Published Papers Search Service


The Least Expectation First (LEF) Media Caching Policy


Kyungwoon Cho, Hyokyung Bahn


Vol. 11  No. 10  pp. 64-69


In this article, we present a novel media caching algorithm adequate for real-world streaming workload. Streaming workload is believed to exhibit very large and sequential access characteristics, which is the main concern of a legacy media caching policy. However, a legacy caching algorithm did not fully utilize access pattern and also tends to overlook streaming interactivity which can decrease the advantage of a caching technique utilizing sequential reference. As a replaced cache is determined based on the expected caching gain of the candidates, cache hit ratio can be significantly improved. We develop Least Expectation First technique which can manage very large number of block caches as two-level grouping. Experimental results show that the proposed media caching scheme yields better hit ratio and I/O smoothing than legacy buffer cache replacement schemes.


Media Caching Algorithm, Interval Caching, Streaming Server, VCR-like operation