Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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
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
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)
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
IEEE Communications Magazine
Multimedia Object Placement for Transparent Data Replication
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper first addresses the problem of computing the optimal locations for placing copies of an object among the enroute caches in coordinated enroute web caching for tree networks, such that the overall cost gain is maximised. We formulate this problem as an optimisation problem and consider both unconstrained and constrained cases. The constrained case includes constraints on the cost gain per node and on the number of copies to be placed. We also derive low cost, dynamic programming based algorithms that provide optimal solutions for these cases. To the best of our knowledge, these problems have not been studied previously. Second, we present a solution for coordinated enroute web caching for autonomous systems, based on the solution for coordinated enroute web caching for tree networks. Finally, we implement the algorithms and compare our methods with existing ones. The simulation results show that our methods outperform existing algorithms for both coordinated enroute web caching for linear topology and object placement at individual nodes.