SPREAD: scalable platform for reliable and efficient automated distribution
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
IEEE/ACM Transactions on Networking (TON)
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Web caching and replication
Coordinated En-Route Web Caching
IEEE Transactions on Computers
IEEE Internet Computing
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A survey of active network research
IEEE Communications Magazine
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
| Hi-index | 0.00 |
Caching popular objects close to users can improve web performance greatly. In this paper, we first propose a novel mathematical model for the coordinated enroute web caching problem of computing the locations for the copies of an object to be placed among the en-route caches in tree networks such that the overall cost gain is maximized under the constraint that the cost gain at each node is non-negative. We formulate this problem as a constrained optimization problem and show that it can be transformed to an unconstrained optimization problem. We present a dynamic programming-based algorithm to obtain an optimal solution to the problem. The time complexity of this algorithm is O(n2), where n is the number of nodes in the network. Second, we consider the coordinated en-route web caching problems under the constraints of placing exactly k copies and at most k copies of an object respectively. We show that these two problems can be solved by tuning the parameter of cost gain in the solution of the first problem.