Information-Centric Networking with caching is a very promising future network architecture. The research on its cache deployment strategy is divided into three categories, namely, noncooperative cache, explicit collaboration cache, and implicit collaboration cache. Noncooperative caching can cause problems such as high content repetition rate in the web cache space. Explicit collaboration caching generally reflects the best caching effect but requires a lot of communication to satisfy the exchange of cache node information and depends on the controller to perform the calculation. On this basis, implicit cooperative caching can reduce the information exchange and calculation between cache nodes while maintaining a good caching effect. Therefore, this paper proposes an on-path implicit cooperative cache deployment method based on the dynamic LRU-K cache replacement strategy. This method evaluates the cache nodes based on their network location and state and selects the node with the best state value on the transmission path for caching. Each request will only select one or two nodes for caching on the request path to reduce the redundancy of the data. Simulation experiments show that the cache deployment method based on the state and location of the cache node can improve the hit rate and reduce the average request length.

中文翻译：

---

基于缓存节点状态和位置的以信息为中心的网络缓存放置方法

具有缓存的以信息为中心的网络是一种非常有前途的未来网络架构。对其缓存部署策略的研究分为三类，即非协作缓存、显式协作缓存和隐式协作缓存。非合作缓存会导致诸如 Web 缓存空间中的高内容重复率等问题。显式协作缓存一般反映了最好的缓存效果，但需要大量的通信来满足缓存节点信息的交换，并且依赖于控制器来执行计算。在此基础上，隐式协同缓存可以减少缓存节点之间的信息交换和计算，同时保持良好的缓存效果。所以，本文提出了一种基于动态LRU-K缓存替换策略的on-path隐式协同缓存部署方法。该方法根据网络位置和状态对缓存节点进行评估，选择传输路径上状态值最好的节点进行缓存。每个请求只会在请求路径上选择一两个节点进行缓存，以减少数据的冗余。仿真实验表明，基于缓存节点状态和位置的缓存部署方法可以提高命中率，减少平均请求长度。每个请求只会在请求路径上选择一两个节点进行缓存，以减少数据的冗余。仿真实验表明，基于缓存节点状态和位置的缓存部署方法可以提高命中率，减少平均请求长度。每个请求只会在请求路径上选择一两个节点进行缓存，以减少数据的冗余。仿真实验表明，基于缓存节点状态和位置的缓存部署方法可以提高命中率，减少平均请求长度。