Local replication for proxy web caches with hash routing
Proceedings of the eighth international conference on Information and knowledge management
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Performance models of a firm's proxy cache server
Decision Support Systems
Analysis of a Least Recently Used Cache Management Policy for Web Browsers
Operations Research
Load Balancing and Hot Spot Relief for Hash Routing among a Collection of Proxy Caches
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Periodic cache replacement policy for dynamic content at application server
Decision Support Systems
Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching
INFORMS Journal on Computing
Optimization in Object Caching
INFORMS Journal on Computing
A Data-Mining-Based Prefetching Approach to Caching for Network Storage Systems
INFORMS Journal on Computing
A new approach for a proxy-level web caching mechanism
Decision Support Systems
Performance evaluation for implementations of a network of proxy caches
Decision Support Systems
An admission-control technique for delay reduction in proxy caching
Decision Support Systems
Service Adoption and Pricing of Content Delivery Network (CDN) Services
Management Science
Information Systems Research
IEEE Journal on Selected Areas in Communications
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
Intra-AS cooperative caching for content-centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
| Hi-index | 0.00 |
Cooperative caching is a popular mechanism to allow an array of distributed caches to cooperate and serve each others' Web requests. Controlling duplication of documents across cooperating caches is a challenging problem faced by cache managers. In this paper, we study the economics of document duplication in strategic and nonstrategic settings. We have three primary findings. First, we find that the optimum level of duplication at a cache is nondecreasing in intercache latency, cache size, and extent of request locality. Second, in situations in which cache peering spans organizations, we find that the interaction between caches is a game of strategic substitutes wherein a cache employs lesser resources towards eliminating duplicate documents when the other caches employs more resources towards eliminating duplicate documents at that cache. Thus, a significant challenge will be to simultaneously induce multiple caches to contribute more resources towards reducing duplicate documents in the system. Finally, centralized decision making, which as expected provides improvements in average latency over a decentralized setup, can entail highly asymmetric duplication levels at the caches. This in turn can benefit one set of users at the expense of the other, and thus will be challenging to implement.