The Study of Dynamic Caching via State Transition Field -- the Case of Time-Varying Popularity
Jie Gao, Lian Zhao, Xuemin (Sherman) Shen

TL;DR
This paper extends the state transition field (STF) framework to analyze dynamic caching under time-varying content popularity, introducing instantaneous STF to evaluate cache performance without steady state assumptions.
Contribution
It introduces the concept of instantaneous STF for time-varying popularity, enabling analysis of cache performance metrics without requiring steady state conditions.
Findings
Instantaneous STF can compute cache hit probabilities under time-varying popularity.
Performance of replacement schemes depends on the pattern of content popularity change.
Simulations with shot noise model validate the analytical insights.
Abstract
In the second part of this two-part paper, we extend the study of dynamic caching via state transition field (STF) to the case of time-varying content popularity. The objective of this part is to investigate the impact of time-varying content popularity on the STF and how such impact accumulates to affect the performance of a replacement scheme. Unlike the case in the first part, the STF is no longer static over time, and we introduce instantaneous STF to model it. Moreover, we demonstrate that many metrics, such as instantaneous state caching probability and average cache hit probability over an arbitrary sequence of requests, can be found using the instantaneous STF. As a steady state may not exist under time-varying content popularity, we characterize the performance of replacement schemes based on how the instantaneous STF of a replacement scheme after a content request impacts on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cloud Computing and Resource Management · Advanced Queuing Theory Analysis
