• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

计算机工程与科学

• 计算机网络与信息安全 • 上一篇    下一篇

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

文凯1,2,3,谭笑1,2   

  1. (1.重庆邮电大学通信与信息工程学院,重庆 400065;
    2.重庆邮电大学通信新技术应用研究中心,重庆 400065;3.重庆信科设计有限公司,重庆 401121)
  • 收稿日期:2018-08-24 修回日期:2019-02-26 出版日期:2019-08-25 发布日期:2019-08-25

A cache replicas placement scheme in D2D networks
 

WEN Kai1,2,3,TAN Xiao1,2
  

  1. (1.School of Telecommunication and Information Engineering,
    Chongqing University of Posts and Telecommunications,Chongqing 400065;
    2.Research Center of New Telecommunications Technology Applications,
    Chongqing University of Posts and Telecommunications,Chongqing 400065;
    3.Chongqing Information Technology Designing Limited Company,Chongqing 401121,China)
  • Received:2018-08-24 Revised:2019-02-26 Online:2019-08-25 Published:2019-08-25

摘要:

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

关键词: D2D缓存, 副本, 命中率, 凸规划

Abstract:

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.
 

Key words: device-to-device (D2D) caching, replica, hit rate, convex programming