Dynamic Programming Based Content Placement Strategy for 5G and Beyond Cellular Networks

Optimal caching strategies of popular
contents in heterogeneous cellular networks are
studied. The increasing demand for data traffic
by users of the wireless network can be handled
by rapaciously caching most frequently accessed
contents by users. Hence, we propose an efficient
popular content placement strategy, the first step
in the content caching process, typically for popular video files. To do so, we introduce a novel
approach for caching popular contents. This caching
strategy follows a dynamic programming approach
to tackle the optimization complexity of selecting
most popular files among a wide range of files,
under certain constraints. The proposed strategy
gives the combination of popular files to be cached
that maximizes the optimal cache hit probability
with a pseudo-polynomial time complexity. To that
end, we used the well-known resourcing algorithm,
called the 0/1-Knapsack problem, assuming that
files are cached without partitioning.