CAJ | 학술논문

针对命名数据网络(Named Data Networking, NDN)存储空间的有效利用和应答内容的高效缓存问题，该文采用“差异化缓存”的方式，提出一种依据内容请求序列相关性的协作缓存算法。在内容请求中，预先发送对于后续相关数据单元的并行预测请求，增大内容请求的就近响应概率；缓存决策时，提出联合空间存储位置与缓存驻留时间的2维差异化缓存策略。根据内容活跃度的变化趋势，空间维度上逐跳推进内容存储位置，时间维度上动态调整内容缓存时间，以渐进式的方式将真正流行的请求内容推送至网络边缘存储。该算法减小了内容请求时延和缓存冗余，提高了缓存命中率，仿真结果验证了其有效性。
침대명명수거망락(Named Data Networking, NDN)존저공간적유효이용화응답내용적고효완존문제，해문채용“차이화완존”적방식，제출일충의거내용청구서렬상관성적협작완존산법。재내용청구중，예선발송대우후속상관수거단원적병행예측청구，증대내용청구적취근향응개솔；완존결책시，제출연합공간존저위치여완존주류시간적2유차이화완존책략。근거내용활약도적변화추세，공간유도상축도추진내용존저위치，시간유도상동태조정내용완존시간，이점진식적방식장진정류행적청구내용추송지망락변연존저。해산법감소료내용청구시연화완존용여，제고료완존명중솔，방진결과험증료기유효성。
How to efficiently utilize the finite storage space and cache content chunks in the content store poses challenges to the caching policy in Named Data Networking (NDN). Using the differentiated caching strategy, a collaborative caching algorithm is proposed based on the request correlation. In the scheme, the subsequent correlated content chunks are requested in advance to increase the hit ratio for content requesting. When making the caching decision, a two-dimensional differentiated caching policy combining the caching location and cache-resident time is proposed. According to the change of content activity, the caching location is pushed downstream hop by hop in the spatial dimension in order to spread popular contents to the network edge in a gradual manner, and the cache-resident time is adjusted dynamically in the time dimension. The simulation results show that the proposed algorithm can efficiently decrease the request latency, reduce the cache redundancy, and achieve higher cache hit ratio than other caching strategies.