Caching in the Sprite network file system
ACM Transactions on Computer Systems (TOCS)
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
A scalable HTTP server: the NCSA prototype
Selected papers of the first conference on World-Wide Web
Performance issues of enterprise level web proxies
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Performance study of a collaborative method for hierarchical caching in proxy servers
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Design Considerations for Distributed Caching on the Internet
Design Considerations for Distributed Caching on the Internet
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
An Expiration Age-Based Document Placement Scheme for Cooperative Web Caching
IEEE Transactions on Knowledge and Data Engineering
Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching
Information Systems Research
Hi-index | 0.00 |
This paper studies controlled local replication for hash routing, such as CARP, among a collection of loosely-coupled proxy web cache servers. Hash routing partitions the entire URL space among the shared web caches, creating a single logical cache. Each partition is assigned to a cache server. Duplication of cache contents is eliminated and total incoming traffic to the shared web caches is minimized. Client requests for non-assigned-partition objects are forwarded to sibling caches. However, request forwarding increases not only inter-cache traffic but also cpu utilization, thus slows the client response time. We propose a controlled local replication of non-assigned-partition objects in each cache server to effectively reduce the inter-cache traffic. We use a multiple-exit LRU to implement controlled local replication. Trace-driven simulations are conducted to study the performance impact of local replication. The results show that (1) regardless of cache sizes, with a controlled local replication, the average response time, inter-cache traffic and CPU overhead can be effectively reduced without noticeable increases in incoming traffic; (2) for very large cache sizes, a larger amount of local replication can be allowed to reduce inter-cache traffic without increasing incoming traffic; and (3) local replication is effective even if clients are dynamically assigned to different cache servers.