Information-centric mobile caching network frameworks and caching optimization: a survey

H Jin, D Xu, C Zhao, D Liang - EURASIP Journal on Wireless …, 2017 - Springer
The demand for content oriented service and compute-intensive service stimulates the shift
of current cellular networks to deal with the explosive growth in mobile traffic. Information …

{AdaptSize}: Orchestrating the Hot Object Memory Cache in a Content Delivery Network

DS Berger, RK Sitaraman… - 14th USENIX Symposium …, 2017 - usenix.org
Most major content providers use content delivery networks (CDNs) to serve web and video
content to their users. A CDN is a large distributed system of servers that caches and …

[HTML][HTML] Learning relaxed belady for content distribution network caching

Z Song, DS Berger, K Li, A Shaikh, W Lloyd… - … USENIX Symposium on …, 2020 - usenix.org
NSDI '20 List of Accepted Papers | USENIX Sign In Conferences Attend Registration
Information Registration Discounts Student Grant Application Diversity Grant Application …

Proof of Optimality based on Greedy Algorithm for Offline Cache Replacement Algorithm.

S Srivastava, PK Singh - International Journal of Next …, 2022 - search.ebscohost.com
The optimal offline cache replacement algorithm is a MIN algorithm that chooses which data
item to remove when a new data item is brought from lower level of cache or main memory …

Practical bounds on optimal caching with variable object sizes

DS Berger, N Beckmann, M Harchol-Balter - Proceedings of the ACM on …, 2018 - dl.acm.org
Many recent caching systems aim to improve miss ratios, but there is no good sense among
practitioners of how much further miss ratios can be improved. In other words, should the …

Expected values estimated via mean-field approximation are 1/n-accurate

N Gast - Proceedings of the ACM on Measurement and Analysis …, 2017 - dl.acm.org
Mean-field approximation is a powerful tool to study large-scale stochastic systems such as
data-centers--one example being the famous power of two-choice paradigm. It is shown in …

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 …

Mean field and refined mean field approximations for heterogeneous systems: It works!

S Allmeier, N Gast - Proceedings of the ACM on Measurement and …, 2022 - dl.acm.org
Mean field approximation is a powerful technique to study the performance of large
stochastic systems represented as n interacting objects. Applications include load balancing …

Optimizing TTL caches under heavy-tailed demands

A Ferragut, I Rodríguez, F Paganini - ACM SIGMETRICS Performance …, 2016 - dl.acm.org
In this paper we analyze the hit performance of cache systems that receive file requests with
general arrival distributions and different popularities. We consider timer-based (TTL) …

Asymptotically exact TTL-approximations of the cache replacement algorithms LRU (m) and h-LRU

N Gast, B Van Houdt - 2016 28th International Teletraffic …, 2016 - ieeexplore.ieee.org
Computer system and network performance can be significantly improved by caching
frequently used information. When the cache size is limited, the cache replacement …