基于ICN的协作缓存和路由机制

Collaborative caching and routing mechanism based on ICN

为解决信息中心网络(ICN, information-centric networking)现存的缓存冗余严重以及无法动态地适应用户请求等问题,提出了一种协作缓存和路由机制,该机制综合权衡位置重要性、内容时效性以及兴趣源距离3个因素,计算回传内容的最优缓存位置,利用指数加权移动平均值模型实现了内容流行度变化的实时监测,以及实现了基于分区的兴趣包以及数据分组路由算法。实验结果与基准机制的对比表明,提出的机制使缓存命中率提升了3%~9%,平均路由跳数减少了16.7%~27.3%。

Aiming at the existing problems of Information-Centric Networking(ICN),such as serious cache redundancy and inability of meeting the users’dynamic needs,a collaborative caching and routing mechanism was proposed.It comprehensively balanced the importance of the node position,the content timeliness and the distance of interest source,and calculated the optimal cache position of the return content.And,it used exponential weighted moving average model to realize real-time monitoring of content popularity change;and a routing algorithm for interest package and data package based on partition was realized.Comparing with the benchmark mechanism,the experimental resets show that the proposed mechanism improved the cache hit rate by 3%~9%and reduced the average routing hops by 16.7%~27.3%.