Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An optimal method for coordinated en-route web object caching|
|Citation:||High performance computing : 5th International Symposium, ISHPC 2003, Tokio-Odaiba, Japan, October 20-22, 2003 : proceedings / Alex Veidenbaum ... [et al.], pp. 368-375|
|Series/Report no.:||Lecture notes in computer science ; 2858.|
|Conference Name:||International Symposium on High Performance Computing (5th : 2003 : Tokyo, Japan)|
|Keqiu Li and Hong Shen|
|Abstract:||Web caching is an important technology for saving network bandwidth, alleviating server load, and reducing the response time experienced by users. In this paper, we consider the object caching problem of determining the optimal number of copies of an object to be placed among en-route caches on the access path from the user to the content server and their locations such that the overall net cost saving is maximized. We propose an object caching model for the case that the network topology is a tree. The existing method can be viewed as a special case of ours since it considers only linear topology. We formulate our problem as an optimization problem and the optimal placement is obtained by applying our dynamic programming-based algorithm. We also present some analysis of our algorithm, which shows that our solution is globally optimal. Finally, we describe some numerical experiments to show how optimal placement can be determined by our algorithm.|
|Keywords:||Web caching; optimization problem; dynamic programming; algorithm|
|Description:||The original publication is available at www.springerlink.com|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.