Integral Caching using Online Mirror Descent in a Networked Context

This paper explores algorithms to optimize networked caching, where requests for files can be handled by a local cache instead of a remote server. Caches work collaboratively to prevent redundant caching, and each new batch of file requests is used to update the entire network. Data is cached in an integral manner, meaning that only discrete...

Online Caching through Optimistic Online Mirror Descent

The advent of wireless networks such as content distribution networks and edge computing networks calls for more effective online caching policies. Traditional policies lose performance since these new networks deal with highly non-stationary requests and frequent popularity shifts. Consequently, a new framework called Online Convex Optimization...

Dynamic Cache Replacement Policy Selection Using Experts

In recent years, researchers proposed several universal caching policies. These universal caching policies aim to work well with any request sequence. However, with this universal well-working property, these caching policies sometimes do not work as well as conventional caching policies such as Least-Recently-Used and Least-Frequently-Used....

Workload Characterization and Modeling, and the Design and Evaluation of Cache Policies for Big Data Storage Workloads in the Cloud

The proliferation of big-data processing platforms has already led to radically different system designs, such as MapReduce and the newer Spark. Understanding the workloads of such systems enables tuning and could foster new designs. However, whereas MapReduce workloads have been characterized extensively, relatively little public knowledge...