Dynamic cooperative caching strategy for delay-sensitive applications in edge computing environment

Abstract

In the context of the interconnection of everything, the edge data are experiencing explosive growth, and the bandwidth and computing resources of cloud computing cannot be efficiently processed. Edge computing, with its low latency, high throughput and low network pressure, has become a very effective mode to deal with massive data. Due to the increasing number of end users, a large number of data are generated on the edge of the network, and the timeliness of users’ service requirements is constantly improving, so further reducing the delay of cloud service network is still a major challenge. Cache is an effective solution to this problem. In order to make full use of the limited edge device space, a dynamic cache replacement algorithm is proposed based on edge popularity and node heat, which caches popular content in the core node and non-popular content in the secondary node, so as to improve the hit rate of the whole network and reduce the server load. In order to meet the increasing demand of data content access in the network, a cooperative caching algorithm is proposed. The idea of this algorithm is to put the cache object in the proper node, so that the user’s request can get timely response. Thus, the availability of the object is improved and the network delay is reduced. In the edge computing environment of campus network, dynamic cache replacement algorithm and cooperative cache algorithm are evaluated. The experimental results show that the dynamic cache replacement algorithm proposed in this paper is better than the benchmark replacement algorithm in cache hit rate, server load, average delay and average hops, and the cooperative cache algorithm is better than the benchmark cooperative cache algorithm in node hit rate and average hops.