基于负载状态的ICN缓存替换算法研究  

Research on ICN cache replacement algorithm based on loadstate

作　　者：曾理 倪宏[1,2] 韩锐 ZENG Li;NI Hong;HAN Rui(National Network Media Engineering Research Center,Insitute of Acoustics,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院声学研究所国家网络新媒体工程技术研究中心,北京100190 [2]中国科学院大学,北京100049

出　　处：《电子设计工程》2023年第1期34-38,共5页Electronic Design Engineering

基　　金：中国科学院战略性科技先导专项课题(XDC2070100)。

摘　　要：针对ICN缓存节点因数据转发与缓存交付流量对端口带宽产生竞争导致网络拥塞的问题,在LRU算法的基础上提出了一种基于节点负载状态的缓存替换算法。该算法通过判断ICN节点是否长期处于带宽竞争,采用自适应的替换窗口将某些较为流行的内容主动替换,避免节点因高缓存命中率引发严重带宽竞争。仿真实验结果表明,与LRU算法相比,所提替换算法能使节点缓存命中率提高14.3%,报文重传概率降低34.9%,内容下载时延降低11.3%。进而提升整体网络性能,使缓存实现更高效的内容分发。To solve the problem of network congestion aggravation caused by bandwidth competition between data forwarding and cache delivery in ICN nodes,a cache replacement algorithm based on the load state of router is proposedon the basis of LRU algorithm.By judging whether ICN nodes are in bandwidth competition for a long time,the algorithm adopts an adaptive replacement window to actively replace some popular contents,so as to avoid the serious bandwidth competition caused by high cache hit rate.Simulation results show that compared with the LRU algorithm,the proposed cache replacement algorithm can effectively improve the nodecache hit rate by 14.3%,reduce the packet retransmission probability by 34.9%,and reduce the content download delay by 11.3%,so as to improve the overall network performance and achieve more efficient content distribution.

关 键 词：信息中心网络 缓存替换算法 带宽竞争 ICN路由器 

分 类 号：TN919[电子电信—通信与信息系统]