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

Neighbor Collaborative Caching Strategy Based on Popularity in Content Centric Networking

作　　者：黄胜[1] 何玉杰[1] 郝言明[1] 刘四军[1] 姜良浩[1] 

机构地区：[1]重庆邮电大学光通信及网络重点实验室,重庆400065

出　　处：《小型微型计算机系统》2017年第9期1928-1933,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61571072;61371096)资助;重庆市基础与前沿研究计划项目(cstc2015jcyjA40015;cstc2013jcyjA40052)资助;重庆市教委科学技术研究项目(KJ130515)资助

摘　　要：为了提高内容中心网络(CCN)的缓存利用率,提出了一种基于流行度的邻居协作缓存策略(PNCC).通过邻域节点间相互协作,根据本节点的数据内容的流行度及来自邻居节点的相同数据内容的请求数,计算出数据传输代价差.根据代价差,PNCC把返回数据存储到流行度最大的节点或其邻居协作缓存节点,以降低数据的传输代价和提高邻域缓存空间的利用率.对缓存已满节点选择流行度最小的数据替换;通过邻居标识表记录邻居节点上存储的内容,让请求内容更准确地获取到邻域存储资源.仿真结果表明,本策略能有效地提高缓存命中率,降低了用户获取数据的时间以及减少了数据传输的跳数.To improve the cache utilization in Content Centric Networking（CCN）,a Popularity-based Neighbor Collaborative Caching strategy （PNCC）,was proposed in the paper.By mutual cooperation between neighbor nodes,according to the popularity of data in the node and request number of the same data from the neighbor nodes,the cost difference of data transmission is computed.Based the cost difference,the return data is decided to be buffered in the either maximum popularity node or the neighbor cooperation node by PNCC,in order to reduce the cost of data transmission and improve the utilization of cache space neighbor.Cache full of single node select the lowest value of the cache data replacement.Recorded content stored on the neighbor node by neighbor identity table,allowing request to more standard fetch data on resource caching neighborhood.The simulation results show that the proposed policy can increase cache hit ratio,reduce the time for users to fetch data and the hop of data transmission.

关 键 词：内容中心网络 邻居协作缓存 内容流行度 代价差 邻居标识表 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]