Energy Efficient Caching in Backhaul-Aware Cellular Networks with Dynamic Content Popularity

Algorithm 1

Age-based threshold policy.

Step 1: Selecting Parameter. (i) is the cache capacity, (ii) is the average request rate, (iii) is the average

total number of request content at any time instant, (iv) is the fraction of caching content catalog,

(v) is the function of distribution. (vi) Define is the th tipper-percentile of , where

.

Step 2: Setting the Age-Based Threshold. Denote is the age-based threshold.

Step 3: Caching Content Vector. Using binary caching vector to determine whether the content is cached

at time .

Step 4: Caching Capacity. We define a constraint condition for the capacity of the cache, if , we will

select with , otherwise set for content.