Caching at Base Stations with Heterogeneous User Demands and Spatial Locality
Dong Liu, Chenyang Yang

TL;DR
This paper develops a caching policy framework for base stations that considers heterogeneous user preferences, activity levels, and spatial locality, demonstrating improved network performance and fairness through real data validation.
Contribution
It introduces a novel framework that optimizes caching by exploiting individual user behavior, moving beyond traditional assumptions of uniform preferences and activity levels.
Findings
Exploiting user heterogeneity improves network performance.
User fairness is enhanced by considering individual preferences.
Performance gains increase with spatial locality skewness.
Abstract
Existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly-distributed or known locations, among which most of the policies are optimized by assuming that user preference is identical to content popularity. However, these assumptions are not true based on recent data analysis. In this paper, we investigate what happens without these assumptions. To this end, we establish a framework to optimize caching policy for base stations exploiting heterogeneous user preference, activity level, and spatial locality. We derive success probability and average rate of each user as utility function, respectively, and obtain the optimal caching policy maximizing a weighted sum of average utility (reflecting network performance) and minimal utility of users (reflecting user fairness). To investigate the intertwined impact of…
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.
