Towards Problem of First Miss under Mobile Edge Caching

Abstract

Mobile Edge Caching (MEC) can cache content at the edge of the network to reduce the delay and overhead of content transmission, which has become an effective method to solve the explosive growth of network traffic. To make good use of the limited resources in edge devices, many contents caching strategies use various methods to predict the popularity of content. However, caches get close to the edge of the network can lead to the rapid increase of caches' number and the user's requests are dispersed into a large number of caches, which leads to the popularity distribution of contents in edge caches is quite different and the number of first miss requests (the corresponding content is requested for the first time and is not in the cache) in edge caches becoming an essential factor affecting the cache hit rate. This paper first demonstrates the significant impact of the first miss requests through dataset analysis and establishes a mathematical model for the first miss problem in the edge cache. Then we analyze the similarity of requests received by caches and propose a proactive push algorithm based on similarity to improve the hit rate of edge caches. Through the trace-driven simulation experiment, we verify that the methods proposed in this paper can significantly improve the caches' hit rate.