Hierarchical dynamic caching mechanism considering content hit-ratio

We propose the dynamic caching mechanism for reducing the total network cost by considering content hit-ratio on hierarchical architecture. In proposed mechanism, the high-layer server distributes the some of the content in database to low-layer server according to content hit-ratio of the high-layer server. Accordingly, the content can be searched in low-layer server via minimum signaling and the content is effectively distributed among servers. In order to evaluate the performance, we compare proposed mechanism against existing caching mechanisms. As a result, we demonstrate that the total network cost can be reduced as well as call setup time.