Cache Replacement Policy for Proxy Server using Type Based Partitioning

초록

The Cache performance cannot be measured only by hit rate because of the variable sizes of objects. Thus. the byte hit rate is also used for the proper evaluation of cache performance. Most of the replacement algorithms do satisfy only one metric. or sometimes none of them. In this paper. we propose a new replacement algorithm to achieve both high hit rate and byte hit rate with great satisfaction. The proposed algorithm appropriately partitions the cache area for each file type. and assigns objects of the same type into the corresponding partition of the cache. We evaluate the hit rate and byte hit rate of the proposed replacement algorithm using the trace driven simulation.