Gain-Aware Caching Scheme Based on Popularity Monitoring in Information-Centric Networking

被引:2
作者
Chen, Long [1 ]
Tang, Hongbo [1 ]
Luo, Xingguo [1 ]
Bai, Yi [1 ]
Zhang, Zhen [1 ]
机构
[1] Natl Digital Switching Syst Engn & Technol, R&D Ctr, Zhengzhou 450002, Peoples R China
基金
中国国家自然科学基金;
关键词
information-centric networking; in-network caching; content placement; chunk-level popularity monitoring; STRATEGY;
D O I
10.1587/transcom.2015EBP3539
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To efficiently utilize storage resources, the in-network caching system of Information-Centric Networking has to deal with the popularity of huge content chunks which could cause large memory consumption. This paper presents a Popularity Monitoring based Gain-aware caching scheme, called PMG, which is an integrated design of cache placement and popularity monitoring. In PMG, by taking into account both the chunk popularity and the consumption saving of single cache hit, the cache placement process is transformed into a weighted popularity comparison, while the chunks with high cache gain are placed on the node closer to the content consumer. A Bloom Filter based sliding window algorithm, which is self-adaptive to the dynamic request rate, is proposed to capture the chunks with higher caching gain by Inter-Reference Gap (IRG) detection. Analysis shows that PMG can drastically reduce the memory consumption of popularity monitoring, and the simulation results confirm that our scheme can achieve popularity based cache placement and get better performance in terms of bandwidth saving and cache hit ratio when content popularity changes dynamically.
引用
收藏
页码:2351 / 2360
页数:10
相关论文
共 32 条
  • [1] Survey on caching approaches in Information Centric Networking
    Abdullahi, Ibrahim
    Arif, Suki
    Hassan, Suhaidi
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2015, 56 : 48 - 59
  • [2] [Anonymous], 2012, P ICN WORKSH INF CTR, DOI [DOI 10.1145/2342488.2342501, 10.1145/2342488.2342501]
  • [3] [Anonymous], 2014, NS3 BASED NAMED DATA
  • [4] [Anonymous], 2012, UCLA
  • [5] Badov M, 2014, P 1 ACM C INF CTR NE, P37
  • [6] Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
  • [7] Cache "less for more" in information-centric networks (extended version)
    Chai, Wei Koong
    He, Diliang
    Psaras, Ioannis
    Pavlou, George
    [J]. COMPUTER COMMUNICATIONS, 2013, 36 (07) : 758 - 770
  • [8] Cho K, 2012, IEEE CONF COMPUT, P316, DOI 10.1109/INFCOMW.2012.6193512
  • [9] Dai HC, 2014, 2014 IEEE 22ND INTERNATIONAL SYMPOSIUM OF QUALITY OF SERVICE (IWQOS), P178, DOI 10.1109/IWQoS.2014.6914318
  • [10] Eum S., 2012, Proceedings of the second edition of the ICN workshop on Informationcentric networking, P49