This paper introduces a new approach to database disk buffering, called the LFU-K method. The LFU-K page replacement algorithm is an improvement to the Least Frequently Used (LFU) algorithm. The paper proposes a theoretical-probability model for formal description of LFU-K algorithm. Using this model we evaluate estimations for the LFU-K parameters. This paper also describes an implementation o...

Renewed interest in caching algorithms stems from their application to content distribution on the Web. When documents are of equal size and their requests are independent and equally distributed, it is well known that static algorithm that keeps the most frequently requested documents in the cache is optimal. However, there are no explicit caching algorithms that are provably optimal when the ...

Web caching and Content Distribution Networks (CDNs) occupy strategic positions in the growth of Internet by effectively delivering data to the end users with reduced access latency. Due to diverse nature of applications, Quality of Service (QoS) is considered an important aspect in web caching. To achieve QoS in Caching scenario web requests are classified into different classes with each clas...

Zebroids are mobile devices that carry a referenced data item from a server containing that data item to a client that requested it. An environment employs zebroids in order to minimize the availability latency incurred by the client. A device acts as a zebroid when it is in close vicinity of a server and travels along a path that rendezvous with the client. Over time, the storage capacity of t...

This paper proposes a novel contribution in Web caching area, especially in Web cache replacement, so-called intelligent client-side Web caching scheme (ICWCS). This approach is developed by splitting the client-side cache into two caches: short-term cache that receives the Web objects from the Internet directly, and long-term cache that receives the Web objects from the short-term cache. The o...

In this paper, we present a new block replacement policy in which we proposed a new efficient algorithm for combining two important policies Least Recently Used (LRU) and Least Frequently Used (LFU). The implementation of the proposed policy is simple. It requires limited calculations to determine the victim block. We proposed our models to implement LRU and LFU policies. The new policy gives e...

This paper describes two approaches to the problem of determining exact optimal storage capacity for Web caches based on expected workload and the monetary costs of memory and bandwidth. The first approach considers memory/bandwidth tradeoffs in an idealized model. It assumes that workload consists of independent references drawn from a known distribution (e.g., Zipf) and caches employ a “Perfe...

Web caches play an important role in improving the surfing experience of Web clients and reducing the network traffic seen by Web servers. Accurate analytical models of Web caches are desirable as they can provide inexpensive ways to make resource provisioning decisions at a cache itself as well as at the Web servers it is servicing. Explicitly modeling a Web cache has two major shortcomings: (...

Most researches concerning uniform caching base their replacement decision on just one parameter. This parameter in some cases may not do well because of the workload characteristics. Some others use more than one parameter. In this case, finding the relation between these parameters and how to combine them is another problem. A number of algorithms try to combine their decision parameter with ...