Placing Dynamic Content in Caches with Small Population

Abstract

This paper addresses a fundamental limitation for the adoption of caching for wireless access networks due to small population sizes. This shortcoming is due to two main challenges: (i) making timely estimates of varying content popularity and (ii) inferring popular content from small samples. We propose a framework which alleviates such limitations. To timely estimate varying popularity in a context of a single cache we propose an Age-Based Threshold (ABT) policy which caches all contents requested more times than a threshold $\tilde{N}(\tau )$, where $\tau$ is the content age. We show that ABT is asymptotically hit rate optimal in the many contents regime, which allows us to obtain the first characterization of the optimal performance of a caching system in a dynamic context. We then address small sample sizes focusing on $L$ local caches and one global cache. On the one hand we show that the global cache learns L times faster by aggregating all requests from local caches, which improves hit rates. On the other hand, aggregation washes out local characteristics of correlated traffic which penalizes hit rate. This motivates coordination mechanisms which combine global learning of popularity scores in clusters and LRU with prefetching.

11 pages, 7 figures, accepted in IEEE INFOCOM 2016

References in corpus (1)

• Placing Dynamic Content in Caches with Small Population

Cited by in corpus (27)

• Wireless Caching: Technical Misconceptions and Business Barriers
• Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-time Popularities
• Placing Dynamic Content in Caches with Small Population
• Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Trade-Offs
• Gibbsian On-Line Distributed Content Caching Strategy for Cellular Networks
• An approximation algorithm for joint caching and recommendations in cache networks
• Enabling Long-term Fairness in Dynamic Resource Allocation
• Online Caching with Optimistic Learning
• Optimistic No-regret Algorithms for Discrete Caching
• Towards Interconnected Virtual Reality: Opportunities, Challenges and Enablers
• Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks with Limited Lifetime and Cache Space
• CABaRet: Leveraging Recommendation Systems for Mobile Edge Caching
• Collaborative Multi-Agent Multi-Armed Bandit Learning for Small-Cell Caching
• Latency-Aware Radio Resource Optimization in Learning-Based Cloud-Aided Small Cell Wireless Networks
• A Swiss Army Knife for Dynamic Caching in Small Cell Networks
• Caching Policy for Cache-enabled D2D Communications by Learning User Preference
• Quid pro Quo in Streaming Services: Algorithms for Cooperative Recommendations
• UtilCache: Effectively and Practicably Reducing Link Cost in Information-Centric Network
• Learning to Cache With No Regrets
• Caching Policy Optimization for D2D Communications by Learning User Preference
• Distributed Edge Caching via Reinforcement Learning in Fog Radio Access Networks
• Optimal Caching Designs for Perfect, Imperfect and Unknown File Popularity Distributions in Large-Scale Multi-Tier Wireless Networks
• Robust, Deep, and Reinforcement Learning for Management of Communication and Power Networks
• Optimized Caching and Spectrum Partitioning for D2D enabled Cellular Systems with Clustered Devices
• Soft-TTL: Time-Varying Fractional Caching
• Understanding Performance of Edge Content Caching for Mobile Video Streaming
• Joint Downlink Scheduling for File Placement and Delivery in Cache-Assisted Wireless Networks with Finite File Lifetime