This article covers how to extend the scope of caching to uncacheable content. It shows how to optimize the performance of J2EE Web applications by caching some of the dynamically-generated content. In this paper, I have identified a design proto-pattern, named Dynamic Caching, which addresses the performance impact of the dynamically generated Web content.

The recent proposal on content-centric network advocates the use of in-network caching to enhance content delivery in the Internet. In this paper, we proposed an in-network caching algorithm based on the concept of ego network betweenness centrality and compared its performance with Van Jacobson’s networking named content caching technique.

In this paper, we propose a novel caching policy called stream Least Recently/Frequently Used (sLRFU) that aims to maximize cache hit rate of CCN routers by incorporating content popularities in the caching decisions. In contrast to existing popularity-based caching policies, sLRFU copes with dynamics in content popularity while operating under the memory and high processing rate constraints of...

Leafcutting ants (Atta and Acromyrmex) sometimes form piles or caches of leaves on foraging trails. Laboratory experiments have shown that leaf caching at the nest entrance by Atta cephalotes and Atta colombica is adaptive because it occurs when a colony’s leaf delivery rate exceeds its leaf-processing rate and serves to increase the probability that a dropped leaf is eventually recovered. We e...

Abstract We present a combined volume and surface rendering technique with global illumination caching. Our approach uses volumetric path tracing to compute the local shading models for isosurface. By joining both visualization approaches, we have enhanced display of surfaces while preserving physically realistic participating media. To achieve real-time performance avoid recomputing image when...

In this paper we address a set of modiications to classical proxy caching algorithms which allow the implementation of a soft caching proxy system. Changes to replacement algorithms are detailed and image size and recoding issues are discussed. We also present our working soft caching testbed based on the Squid proxy, detail the modiications we have made and present the experiences obtained.

A new cooperative caching mechanism, PACA, along with a caching algorithm, LRU-Interleaved, and an aggressive prefetching algorithm , Full-File-On-Open, are presented. The caching algorithm is especially targeted to parallel machines running a microkernel-based operating system. It avoids the cache coherence problem with no loss in performance. Comparing our algorithm with N-Chance Forwarding ,...

In order to make surfing the internet faster, and to save redundant processing load with each request for the same web page, many caching techniques have been developed to reduce latency of retrieving data on World Wide Web. In this paper we will give a quick overview of existing web caching techniques used for dynamic web pages then we will introduce a design and implementation model that take...

A batch processing job in a distributed system has three clear steps, stage-in, execution, and stage-out. As data sizes have increased, the stage-in time has also increased. In order to optimize stage-in time for shared inputs, we propose the CacheD, a caching mechanism for high throughput computing. Along with caching on worker nodes for rapid transfers, we also introduce a novel transfer meth...

Streaming media has contributed to a significant amount of today’s Internet traffic. Like conventional web objects (e.g., HTML pages and images), media objects can benefit from proxy caching; yet their unique features such as huge size and high bandwidth demand imply that conventional proxy caching strategies have to be substantially revised. This chapter discusses the critical issues and chall...