D2D网络中的缓存副本数布设算法

A cache replicas placement scheme in D2D networks

在Device-to-Device(D2D)缓存网络中,缓存文件的副本数量是制约系统缓存效率的重要因素,过多的副本会导致缓存资源不能得到充分利用,副本数过低又将使流行文件难以被有效获取。针对D2D缓存网络副本布设问题,以系统缓存命中率最大化为目标,利用凸规划理论,提出了一种缓存文件副本数布设算法(CRP)。仿真结果显示,与现有副本数量布设算法相比,该算法可以有效提升D2D缓存网络总体缓存命中率。

In the device-to-device(D2D)caching network,the number of cache replicas is an important factor that restricts the caching efficiency of the system.Excessive replicas cannot make full use of the cache resources while insufficient replicas make it difficult for popular files to be obtained effectively.To address the issue of cache replicas placement(CRP)in D2D cache networks,utilizing the convex programming theory,we design a CRP scheme with the goal of maximizing the cache hit ratio of the system.Simulation results show that compared with existing replicas placement schemes the proposed scheme can effectively improve the overall cache hit rate of the D2D cache network.