基于相关性概率的信息中心网络协作缓存策略  

Cooperative Caching Strategy Based on Correlation Probability in Information Centric Networking

作　　者：霍如[1] 刘江[1] 黄韬[1] 陈建亚[2] 刘韵洁[1] 

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876 [2]北京邮电大学网络体系架构与融合北京市重点实验室,北京100876

出　　处：《北京邮电大学学报》2015年第1期16-20,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家重点基础研究发展计划(973计划)项目(2012CB315801);国家自然科学基金项目(61300184;61302089);中央高校基本科研业务费专项资金资助课题项目(2013RC0113)

摘　　要：信息中心网络(ICN)的节点缓存功能有助于海量内容的高效分发,缓解链路拥塞并减少流量冗余.传统的缓存策略不利于提高全网缓存的内容多样性和缓存节点的平均命中率,现有研究能在一定程度上解决这些问题,实现了公平的内容流复用,但没有充分考虑节点之间的协作,导致节点缓存的利用率不均.为了解决上述问题,从当前节点缓存状态对其他节点的影响入手,提出一种基于相关性概率的ICN协作缓存策略,根据路径及相邻节点信息做出本节点的缓存判断,从而有效控制缓存冗余.仿真结果表明,该方法可以减轻服务器负载,丰富全网内容多样性,有利于提高交错复杂网络节点的命中率和利用率,减少请求跳数.The in-network caching of information centric networking（ ICN） can offer help to the massive contents distributions efficiently,the ease link congestion and the traffic redundancy reductions. Traditional caching policies are not conducive to raise content diversity of the whole network and average hit rate of cache nodes. The existing research can solve the problems to some extent,and achieve fair content flow multiplexing,however,almost no consideration of collaboration between nodes is adopted,which directly results in uneven utilization of cache nodes. To solve these problems,study on influence of caching status between neighbor nodes was made,and a cooperative caching strategy based on correlation probability in ICN was presented. Cache node will make caching decision based on the information of path and its neighbor node,so it can control the caching redundancy. Simulation shows that this method can ease the server load,and enrich the content diversity of the whole network. It is of benefit to improve the hit rate of nodes in complex network,and reduce the number of hops.

关 键 词：信息中心网络 协作缓存 相关性 概率 

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