Crucial performance metrics of a caching algorithm include its ability to quickly and accurately learn popularity distribution requests. However, majority work on analytical analysis focuses hit probability after an asymptotically large time has elapsed. We consider online learning viewpoint, characterize the “regret” in terms finite difference between hits achieved by candidate w...

We consider a generalization of the standard cache problem called file-bundle caching, where different queries (tasks), each containing l ≥ 1 files, sequentially arrive. An online algorithm that does not know sequence ahead time must adaptively decide on what files to keep in incur minimum number misses. Here miss refers case at least one file query is missing among files. In special = 1, this ...

Everyone loves a large caching tier in their multitier cloud-based web service because it both alleviates database load and provides lower request latencies. Even when load drops severely, administrators are reluctant to scale down their caching tier. This paper makes the case that (i) scaling down the caching tier is viable with respect to performance, and (ii) the savings are potentially huge...

In the context of coded caching in the K-user BC, our work reveals the surprising fact that having multiple (L) transmitting antennas, dramatically ameliorates the long-standing subpacketization bottleneck of coded caching by reducing the required subpacketization to approximately its Lth root, thus boosting the actual DoF by a multiplicative factor of up to L. In asymptotic terms, this reveals...

Caching is a key technique for improving the data retrieval performance of mobile clients in mobile environments. The emergence of robust and reliable technologies now brings to reality what we call "cooperative caching‖ in which mobile clients can access data items from the cache in their neighbouring peers. We discuss cooperative caching in mobile environments and propose a cooperative cachin...

Lately researchers are looking at ways to reduce the delay on video playback through mechanisms like prefetching and caching for Videoon-Demand (VoD) services. The usage of prefetching and caching also has the potential to reduce the amount of network bandwidth usage, as most popular requests are served from a local cache rather than the server containing the original content. In this paper, we...

The bandwidth of a wireless network is usually very limited as compared to that of a static network. Therefore, caching the right set of data into the limited storage of mobile computers is an important issue in mobile database applications. Caching not only reduces the contention on the narrow bandwidth of a wireless channel, but also improves the response time for read operations. However, we...

Caching is an important means to scale up the growth of the Internet. Weak consistency is a major approach used in Web caching and has been deployed in various forms. This paper investigates some properties and performance issues of an expiration-based caching system. We focus on a hierarchical caching system based on the Time-To-Live (TTL) expiration mechanism and present a basic model for suc...

Caching is an e ective technique for improving performance in Databases and Information Retrieval (IR) systems. Traditional IR systems access the collection indices to perform searches. Such searches on large corpora for queries oft repeated can be computationally redundant. In addition, querying remote sources can be expensive because of large communication overheads and frequent inavailabilit...

5.1 INTRODUCTION As discussed in previous chapter (chapter 4), Web caching and Web pre-fetching are two well known techniques used for enhancing the performance of Web-based information retrieval system. One of the ultimate research objectives of this thesis research work mentioned in chapter 1 is to identify and experiment Web caching replacement algorithms and to integrate Web caching and clu...