Towards generalized optimal cache proxy placement

A study on cache proxy placement for tree-based topology is presented in this paper. Web caching has been developed maturely to deal with burst increasing network traffic. Most existing works on web caching focus on content-based issue. Some of the newly published papers discussed the placement of caches and presented algorithms to find out the optimal solution. However, they all assume constant hit ratio, which is for mirroring proxies. In this paper, we investigate the optimal placement of cache proxies, based on a dynamic hit ratio model. We propose a refined greedy algorithms to solve this problem. Intensive simulations have been conducted to evaluate performance of the proposed algorithms and compare it with constant hit ratio scenario.