Cache Placement Optimization in Hierarchical Networks: Analysis and Performance Evaluation
Caching popular content in the Internet has been recognized as one of the effective solution to alleviate network congestion and accelerate user information access. Sharing and coordinating in cache data placement provide an opportunity to improve system performance. This paper studies cache placement strategies and their performance in hierarchical network environments. A theoretical model is introduced to analyze the access cost of placing a set of object copies in the cache hierarchy, under which the object placement problem is formulated as an optimization problem. The problem is proved to be divided into subproblems, and a dynamic programming algorithm is proposed to obtain the optimal solution. Performance of different caching strategies is evaluated using simulations. It is shown that the proposed algorithm outperforms other cache placement strategies in hierarchical caching systems.
Keywordscooperative caching hierarchical caching system cache placement and replacement
- 1.Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: Evidence and implications. In: INFOCOM 1999: Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 126–134 (1999)Google Scholar
- 2.Chankhunthod, A., Danzig, P.B., Neerdaels, C., Schwartz, M.F., Worrell, K.J.: A hierarchical internet object cache. In: ATEC 1996: Proceedings of the Annual Technical Conference on USENIX 1996 Annual Technical Conference, Berkeley, CA, USA. USENIX Association, pp. 13–13 (1996)Google Scholar
- 3.Che, H., Wang, Z., Tung, Y.: Analysis and design of hierarchical web caching systems. In: Proc. of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 1416–1424. IEEE, Los Alamitos (2001)Google Scholar
- 5.Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Placement algorithms for hierarchical cooperative caching. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 586–595. Society for Industrial and Applied Mathematics (1999)Google Scholar