A caching relay for the World Wide Web
Selected papers of the first conference on World-Wide Web
Frameworks for component-based client/server computing
ACM Computing Surveys (CSUR)
Memory-based architecture for distributed WWW caching proxy
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Performance study of a collaborative method for hierarchical caching in proxy servers
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Adaptive web caching: towards a new global caching architecture
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Introduction to Simulation Modeling Using GPSS/PC
Introduction to Simulation Modeling Using GPSS/PC
Web Caching
Guest Editor's Introduction: Caching in Distributed Systems
IEEE Concurrency
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The CACHERPframework leverages the relative object popularity as the sole parameter for dynamic cache size tuning. In the process it consistently maintains the prescribed cache hit ratio on the fly by deriving the popularity ratio from the current statistics. As a result the accuracy of the statistical CACHERPoperation is independent of changes in the Internet traffic pattern that may switch suddenly. The contribution by the novel CACHERPframework is that by adaptively maintaining the given hit ratio it effectively reduces the end-to-end information retrieval roundtrip time (RTT) and frees more bandwidth for sharing. This bandwidth would otherwise be consumed in transferring large amounts of data from remote data sources to the proxy server before it is given to the client or requestor.