Cache placement optimization in hierarchical networks: analysis and performance evaluation

Authors:
Wenzhong Li;Edward Chan;Yilin Wang;Daoxu Chen;Sanglu Lu
Affiliations:
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China and Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China and Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China
Venue:
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Year:
2008

Citing 8
Cited 0

A case for caching file objects inside internetworks

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Placement algorithms for hierarchical cooperative caching

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of web caching architectures: hierarchical and distributed caching

IEEE/ACM Transactions on Networking (TON)
Coordinated En-Route Web Caching

IEEE Transactions on Computers
Proxy Cache Algorithms: Design, Implementation, and Performance

IEEE Transactions on Knowledge and Data Engineering
Optimal methods for coordinated enroute web caching for tree networks

ACM Transactions on Internet Technology (TOIT)
The LCD interconnection of LRU caches and its analysis

Performance Evaluation
A hierarchical internet object cache

ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.