Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
In this paper, we propose a PPC (popularity-based Partial Caching) scheme for continuous media objects on the proxy servers. In this scheme, either the initial portion or the entire blocks of objects are cached and the size of the initial ortion of each stream varies with the popularity of that stream. Under the proposed scheme, the initial latency otherwise happens to access the requested objects from the remote server can be reduced significantly and moreover, the limited cache storage space can be utilized efficiently. Considering the characteristics of continuous media objects, we also apply the popularity of each stream by taking the amount of the data of each stream played back by clients into consideration. As a result of trace-driven simulations with 9 days of log files for VoD server, which were obtained from the website http://imbc.hananet.net, we show that, PPC, our proposed caching scheme, outperforms other well-known caching schemes in hit ratios and replacement overhead.
E. J. Lim, S. Ho and K. D. Chung, "Popularity-based Partial Caching for VOD Systems using a Proxy Server," Parallel and Distributed Processing Symposium, International(IPDPS), San Francisco, California, USA, 2001, pp. 30115a.