信息中心网络中协作的内容缓存和请求路由算法

Coordinated Content Caching and Request Routing Algorithm in Information Centric Networking

信息中心网络与传统IP网络区别的重要特点是在路由器节点配备缓存设施,将热门内容推送到更靠近用户的网络边缘,从而降低用户获取内容的时延。为了提高缓存空间的利用率,避免内容在相邻节点的冗余放置,本文提出了一种分层协作的内容放置和请求路由算法,在层次结构的接入网络中,依据内容的访问热度仅在层次结构的其中一层放置内容副本以减少内容的冗余备份;此外,通过建立二元标签组记录内容的放置信息,用于动态引导请求的转发;仿真结果表明,与现有的缓存放置算法相比,分层协作的内容缓存和请求路由机制,提高了网络存储内容的多样性,并降低了用户访问内容的时延。

Equipping routers with cache is the crucial feature that makes Information Centric Networking （ICN） different from the tradi- tional IP network, and works effectively to delivery popular contents to edge networks closer to users for reducing content access time. In order to improve the cache storage usage and as well as avoid redundant content placement, this paper proposes a coordinated content placement and request routing algorithm. In the hierarchical access network, we propose to cache a content only in one layer of the hi- erarchy according to the popularity of the content. The content placement information is also recorded in a tuple label and can be used for guiding request forwarding. Simulation results show that the proposed algorithm improves the content diversity of the network and lowers the content access time compared with the existing caching and routing mechanisms.