Cache optimization models and algorithms

G Paschos, G Iosifidis, G Caire - Foundations and Trends® in …, 2020 - nowpublishers.com
Caching refers to the act of replicating information at a faster (or closer) medium with the
purpose of improving performance. This deceptively simple idea has given rise to some of …

Proactive retention aware caching

S Shukla, AA Abouzeid - IEEE INFOCOM 2017-IEEE …, 2017 - ieeexplore.ieee.org
We consider the problem of proactive (ie predictive) content caching that is aware of the
costs of retention of the content in the cache. Prior work on caching (whether proactive or …

Optimization of heterogeneous coded caching

AM Daniel, W Yu - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
This paper aims to provide an optimization framework for coded caching that accounts for
various heterogeneous aspects of practical systems. An optimization theoretic perspective …

Fundamental limits of caching

MA Maddah-Ali, U Niesen - IEEE Transactions on information …, 2014 - ieeexplore.ieee.org
Caching is a technique to reduce peak traffic rates by prefetching popular content into
memories at the end users. Conventionally, these memories are used to deliver requested …

Adaptive caching networks with optimality guarantees

S Ioannidis, E Yeh - IEEE/ACM transactions on networking, 2018 - ieeexplore.ieee.org
We study the optimal placement of content over a network of caches, a problem naturally
arising in several networking applications. Given a demand of content request rates and …

Characterizing the rate-memory tradeoff in cache networks within a factor of 2

Q Yu, MA Maddah-Ali… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
We consider a basic caching system, where a single server with a database of N files (eg,
movies) is connected to a set of K users through a shared bottleneck link. Each user has a …

[图书][B] Investigation of generalized caching

S Hosseini-Khayat - 1997 - search.proquest.com
This dissertation studies the replacement problem that arises in caching data objects of non-
uniform size. It assumes that the cache miss penalties are also non-uniform. It formulates the …

Network cache design under stationary requests: Exact analysis and Poisson approximation

NK Panigrahy, J Li, D Towsley, CV Hollot - Computer Networks, 2020 - Elsevier
The design of caching algorithms to maximize hit probability has been extensively studied.
In this paper, we associate each content with a utility, which is a function of either the …

Fundamental limits of caching: Improved bounds for small buffer users

Z Chen, P Fan, KB Letaief - arXiv preprint arXiv:1407.1935, 2014 - arxiv.org
In this work, the peak rate of the caching problem is investigated, under the scenario that the
users are with small buffer sizes and the number of users is no less than the amount of files …

The role of caching in future communication systems and networks

GS Paschos, G Iosifidis, M Tao… - IEEE Journal on …, 2018 - ieeexplore.ieee.org
This paper has the following ambitious goal: to convince the reader that content caching is
an exciting research topic for the future communication systems and networks. Caching has …