Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2015, Vol. 38 ›› Issue (1): 16-20.doi: 10.13190/j.jbupt.2015.01.003

• Papers • Previous Articles     Next Articles

Cooperative Caching Strategy Based on Correlation Probability in Information Centric Networking

HUO Ru1, LIU Jiang1, HUANG Tao1, CHEN Jian-ya2, LIU Yun-jie1   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2014-03-26 Online:2015-02-28 Published:2015-03-30

Abstract:

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.

Key words: information centric networking, cooperative caching, correlation, probability

CLC Number: