Modeling and Optimization of Mobility-Aware Dynamic Caching With Time-Varying Content Popularity

A mobility-aware dynamic caching optimization problem (MDCP) is modelled for optimal caching when the contents' popularity may vary over time. The NP-hardness of MDCP is proved. For the problem's solution, first, by providing a reformulation, the optimum of MDCP can be computed in up to medium-scale system scenarios. In addition, a time-efficient algorithm is developed for large-scale scenarios. The results of performance evaluation are provided.