Dynamic Update Cache Scheme Based on Feedback Times for Device-to-Device Caching Networks

On the premise of determining the order of cached files according to Zipf law, this paper proposes a dynamic update caching strategy (SBRC-2DS) based on file segment caching scheme. In this scheme, the user cache space is divided into three parts, and each cache space is equal probability random to cache the corresponding files in the file library segments, and the probability of caching different segments of the files is different. According to the dynamic change of the number of file requests, the segmentation criteria of the file library are updated accordingly, and the updating method adopts the percentage updating method. Only 20% of the files are filtered at a time and placed in the segment of the file library with the smallest hit probability. The simulation results show that SBRC-2DS has sufficient advantages in improving cache hit ratio compared with several existing classical cache strategies.