TY - GEN
T1 - Cache placement optimization in hierarchical networks
T2 - 7th International IFIP-TC6 Networking Conference - NETWORKING 2008: AdHoc and Sensor Networks, Wireless Networks, Next Generation Internet
AU - Li, Wenzhong
AU - Chan, Edward
AU - Wang, Yilin
AU - Chen, Daoxu
AU - Lu, Sanglu
PY - 2008
Y1 - 2008
N2 - 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. © 2008 Springer-Verlag Berlin Heidelberg.
AB - 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. © 2008 Springer-Verlag Berlin Heidelberg.
KW - Cache placement and replacement
KW - Cooperative caching
KW - Hierarchical caching system
UR - http://www.scopus.com/inward/record.url?scp=44649123811&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-44649123811&origin=recordpage
U2 - 10.1007/978-3-540-79549-0_34
DO - 10.1007/978-3-540-79549-0_34
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 3540795480
SN - 9783540795483
VL - 4982 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 385
EP - 396
BT - NETWORKING 2008: AdHoc and Sensor Networks, Wireless Networks, Next Generation Internet
PB - Springer Verlag
Y2 - 5 May 2008 through 5 September 2008
ER -