命名数据网络中基于局部请求相似性的协作缓存路由机制

发布时间：2019-03-12 10:51

【摘要】：该文针对命名数据网络(Named Data Networking,NDN)应答内容的高效缓存和利用问题,依据内容请求分布的局域相似特征,提出一种协作缓存路由机制。缓存决策时,将垂直请求路径上的冗余消除和水平局域范围内的内容放置进行有效结合。垂直方向上,提出基于最大内容活跃因子的路径缓存策略,确定沿途转发对应的最大热点请求区域;水平方向上,采用一致性Hash协同缓存思想,实现应答内容的局域定向存储。路由查找时,将局域节点缓存引入到路由转发决策中,依据内容活跃等级动态执行局域缓存查找,增大内容请求就近响应概率。该机制减小了内容请求时延和缓存冗余,提高了缓存命中率,以少量额外的代价换取了内容请求开销的大幅下降,仿真结果验证了其有效性。
[Abstract]:In this paper, according to the local similarity of content request distribution, a cooperative cache routing mechanism is proposed for the efficient caching and utilization of (Named Data Networking,NDN (named data network) response content. When caching decision, the redundancy elimination on the vertical request path is effectively combined with the horizontal local content placement. In the vertical direction, a path caching strategy based on the maximum content activity factor is proposed to determine the corresponding maximum hot spot request area along the route, and in the horizontal direction, the consistent Hash cooperative caching idea is used to realize the local directional storage of the response content. When routing lookup, local node cache is introduced into routing forwarding decision, and local cache lookup is performed dynamically according to the active level of content, so as to increase the probability of near response of content request. This mechanism reduces content request delay and cache redundancy, improves cache hit ratio, and reduces the cost of content request with a small amount of extra cost. The simulation results show that the proposed scheme is effective.
【作者单位】：国家数字交换系统工程技术研究中心;
【基金】：国家973计划项目(2012CB315901) 国家自然科学基金(61372121) 国家863计划项目(2011AA01A103)资助课题
【分类号】：TP333

【参考文献】