CCN中一种基于流行度的邻居协作缓存策略

发布时间：2019-03-31 17:46

【摘要】：为了提高内容中心网络(CCN)的缓存利用率,提出了一种基于流行度的邻居协作缓存策略(PNCC).通过邻域节点间相互协作,根据本节点的数据内容的流行度及来自邻居节点的相同数据内容的请求数,计算出数据传输代价差.根据代价差,PNCC把返回数据存储到流行度最大的节点或其邻居协作缓存节点,以降低数据的传输代价和提高邻域缓存空间的利用率.对缓存已满节点选择流行度最小的数据替换;通过邻居标识表记录邻居节点上存储的内容,让请求内容更准确地获取到邻域存储资源.仿真结果表明,本策略能有效地提高缓存命中率,降低了用户获取数据的时间以及减少了数据传输的跳数.
[Abstract]:In order to improve the cache utilization of content center network (CCN), a neighbor cooperative cache strategy (PNCC).) based on popularity is proposed. According to the popularity of the data content of the node and the number of requests for the same data content from the neighbor node, the cost difference of the data transmission is calculated through the cooperation between the neighboring nodes. According to the cost difference, PNCC stores the returned data to the node with the highest popularity or its neighbor cooperative cache node, so as to reduce the cost of data transmission and improve the utilization of the neighboring cache space. The data replacement with the least popularity is selected for the cache full node, and the contents stored on the neighbor node are recorded by the neighbor identification table, so that the requested content can obtain the neighborhood storage resources more accurately. The simulation results show that this strategy can effectively improve the cache hit ratio, reduce the user time to obtain data and reduce the number of hops in data transmission.
【作者单位】：重庆邮电大学光通信及网络重点实验室;
【基金】：国家自然科学基金项目(61571072,61371096)资助重庆市基础与前沿研究计划项目(cstc2015jcyjA40015,cstc2013jcyjA40052)资助重庆市教委科学技术研究项目(KJ130515)资助
【分类号】：TP393.02

【相似文献】