Аңдатпа
Content caching is perceived as a promising approach to offload traffic from shared medium networks by pre-fetching and placing contents in caches during off-peak hours, and taking advantage of multicasting in the delivery times. While most existing efforts on caching are directed towards reducing the traffic rate over the shared medium, little attention is given to user preferences. Though placement based on the heterogeneity of content popularity improves the caching performance, it is understood to be a non-trivial combinatorial optimization problem. In this paper, we investigate the content caching problem under non-uniform and user-dependent demands and propose several heuristic methods by leveraging hybrid coded-uncoded caching, clustering, and the trade-off between local and global popularity of contents. Simulation results validate our analysis and show the out-performance of the proposed schemes with respect to existing methods.