Optimal Content Placement for En-Route Web Caching

11 years 10 months ago
Optimal Content Placement for En-Route Web Caching
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally that the file-placement solution output by our algorithm outperforms existing enroute caching policies. The optimal placement of web files can be implemented with a reasonable level of cache coordination and management overhead for en-route caching; and importantly, it can be achieved with or without using data prefetching. 1 This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology.
Anxiao Jiang, Jehoshua Bruck
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where NCA
Authors Anxiao Jiang, Jehoshua Bruck
Comments (0)