With rapid proliferation of the internet, lots of content providers make their market debuts on the internet for internet broadcasting systems, VoD service and advertizement using moving pictures; this eventually leads to heavy traffic on the internet. Proxy caching is one of the widely known techniques to solve this problem but so far it has been told not to show satisfiable performance for co...

This study examines the performance of an elearning environment in terms of average network traffic and upload/download rates under various cache memory organizations. In particular, we study the influence of three cache organizations, namely fully associative, direct, and set associative caches. As a result of this work, we recommend the set associative cache memory organization with the Least...

High precision electroweak tests, such as deviations from the Standard Model expectations of the Lepton Flavor Universality (LFU) breaking in K → lνl (with l = e or μ), represent a powerful tool to test the Standard Model and, hence, to constrain or obtain indirect hints of New Physics beyond it. We explore such a possibility within Supersymmetric theories. Interestingly enough, a process that ...

High precision electroweak tests, such as deviations from the Standard Model expectations of the Lepton Flavor Universality breaking in K → lνl (with l = e or μ), represent a powerful tool to test the Standard Model and, hence, to constrain or obtain indirect hints of New Physics beyond it. We explore such a possibility within Supersymmetric theories. Interestingly enough, a process that in its...

In mobile wireless data access networks, remote data access is expensive in terms of bandwidth consumption. An efficient caching scheme can reduce the amount of data transmission, hence, bandwidth consumption. However, an update event makes the associated cached data objects obsolete and useless for many applications. Data access frequency and update play a crucial role in deciding which data o...

▪ Replayed Facebook and Bing workloads ▪ LIFE reduces average completion time by 53% and 51% in Facebook and Bing workloads ▪ Small jobs see 77% improvement ▪ LFU-F improves cluster utilization by 47% and 53% in the Facebook and Bing workloads ▪ LIFE and LFU-F beat Belady’s MIN despite lower cache hit-ratio ▪ Pre-fetch & Pre-replace → Ideal (87%) speedup ▪ Pre-replacement ~ Oracle cache evictio...

Peer-to-Peer (P2P) video caching is a promising approach to accommodate asynchronous requests from cached content at individual peers. However, coherently managing a distributed, heterogeneous, dynamic and potentially large scale cache space is a challenging task. In particular, a key challenge is to effectively control the number of cached copies for popular streams in order to accommodate the...

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...