Popularity-Aware In-Network Caching for Edge Named Data Network

Figure 2

An example about the request probability distribution of content with different popularity in the binary tree network. The popularity of the three contents is 3.00%, 0.30%, and 0.03%; the frequency of single-user requests is 50. There is no caching mechanism in the user node, so the probability is 0 in user.