Journal on Communications ›› 2016, Vol. 37 ›› Issue (5): 62-72.doi: 10.11959/j.issn.1000-436x.2016093

• Papers • Previous Articles     Next Articles

Probability-based heuristic content placement method for ICN caching

Hai-bo WU1,Jun LI1(),Jiang ZHI1,2   

  1. 1 Computer Network Information Center,Chinese Academy of Sciences,Beijing 100190,China
    2 Graduate School,Chinese Academy of Sciences,Beijing 100049,China
  • Online:2016-05-25 Published:2016-06-01
  • Supported by:
    Around Five Top Priorities of“One-Three-Five”Strategic Planning,CNIC;The National Basic Research Program of China(973 Program);The Knowledge Innovation Program of the Chinese Acade-my of Sciences;The Significant Equipment Development Program of Chinese Academy of Sciences

Abstract:

A probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back,on-path cache nodes decide whether to cache the content with certain probability.The probability is associated with the content popu-larity and placement benefit,i.e.,proportional to content popularity and content placement benefit.The experimental re-sults indicate PCP can achieve salient performance gain in terms of cache service ratio,cache hit ratio,access latency ra-tio,compared with current strategies.Meanwhile,PCP's overhead is affordable.

Key words: information-centric networking, in-network caching, content placement, cooperative caching

No Suggested Reading articles found!