In this paper, we design dynamic probabilistic caching for the scenario when the instantaneous content popularity may vary with time while it is possible to predict the average content popularity over a time window. Based on the average content popularity, optimal content caching probabilities can b...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!