Abstract
A mobility-aware dynamic caching optimization problem (MDCP) is modelled for optimal caching when the contents’ popularity may vary over time. The $\mathcal {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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
