摘要： 内容中心网络(CCN)默认采用的处理缓存方式存在严重的缓存冗余,而基于介数的缓存决策虽然降低了缓存冗余,但其计算复杂度较高,不适合部署在CCN网络层。为此,提出基于K核分解的缓存决策策略。给出基于K核分解方法的K核值指标定义,将数据对象缓存到请求路径上K核值最高的节点,并给出当K核值相同时依据剩余缓存空间和请求跳数的决策策略。仿真实验结果表明,基于K核分层的缓存决策策略具有较快的收敛速度,在缓存系统稳定时有更高的缓存命中率和更快的缓存响应速度。

关键词: 内容中心网络, 缓存决策, 介数, K核分解, 缓存命中率

Abstract: Due to the leaving copies everywhere cache decision-making strategy that Content-centric Networking(CCN)uses by default has the cache redundancy problem,and although the cache decision-making strategy based on betweenness reduces the cache redundancy,its computational complexity is very high,thus not suitable for deployment in CCN network layer. Thus,this paper proposes a cache decision-making strategy based on K-core decomposition method. It calculates the K-core value of every node in the current network,the higher the K-core value is the more important the node to the network of information dissemination when cache data are needed to on the request path,and gives decision-making strategy according to remain cache space and request hop when same the K-core value. Simulation results show that compared to the cache decision-making strategy based on betweenness,cache decision-making strategy based on K-core decomposition method has faster convergence speed. When the network reaches a steady state,it has a higher cache hit ratio and faster response speed.

Key words: Content-centric Networking(CCN), cache decision-making, betweenness, K-core decomposition, cache hit ratio

中图分类号: 

• TP391