信息中心网络中基于局部内容活跃度的自适应缓存算法-计算机科学.pdfVIP

第 43 卷第11 期 计算机科学 Vo 1. 43 No. 11 2016 年 11 月 Computer Science Nov 2016 信息中心网络中基于局部内容活跃度的自适应缓存算法 田铭邬江兴兰巨龙 (信息工程大学 郑州1 45000 1) 摘 要 通过对信息中心网络的网内节点缓存建模，分析发现基于全局内容流行度的替换策略不适用于信息中心网 络的分布式模式。继而提出了一种基于局部内容活跃度的缓存替换策略LAU，并基于该策略提出了一种自适应路径 缓存算法 ACAP，使缓存内容按照本地活跃度依次缓存在访问珞径中。仿真结果表明，LAU 策略提高了羊节点缓存 命中率;ACAP 相比已有的路径缓存算法，具有较低的服务器命中率和跳数比。最后对该算法适用的缓存结构和拓扑 结构进行了讨论和分析。 关键词 信息中心网络，缓存替换策略，缓存算法，内容活跃度 中固法分类号 TP393 文献标识码 A DOI 10. 11896/j. issn. 1002-137X. 2016. 11. 032 Adaptive Cache Algorithm Based on Local Content Activity in Information-centric Networks TIAN 岛但ng ^几J Jiang-xing LAN Ju-long (The PLA Information Engineering University ,Zhengzhou 450001 ,China) Abstract After modeling analysis ,we found that replacement policy based on global content popularity does not suit for the distributed model of information centric networks. This paper presented a cache replacement policy based on local content activity called LAU. And an adaptive path caching algorithm named ACAP was proposed ,so that the contents were cached successively in access path on the basis of local activity. The simulation results show that LAU strategy improves the cache hit rate of the single-node. Compared to the existing path caching algorithms ,ACAP has low hit rate of server response and low hop ratio. At last , the applicable cache and topology structure of this algorithm were dis cussed and analyzed. Keywords Information-centric networks ,Cache replacement strategy ,Cache algorithm , Content activity 据网络 NDN[5J 就是其中的代表，它利用沿途缓存(In-path