Computer Science ›› 2018, Vol. 45 ›› Issue (7): 116-121.doi: 10.11896/j.issn.1002-137X.2018.07.019

• Network & Communication • Previous Articles     Next Articles

Caching and Replacing Strategy in Information-centric Network Based on Content Popularity and Community Importance

LUO Jian-zhen,CAI Jun ,LIU Yan,ZHAO Hui-min   

  1. Guangdong Polytechnic Normal University,Guangzhou 510665,China
  • Received:2017-10-10 Online:2018-07-30 Published:2018-07-30

Abstract: The temporal and spatial distribution of content in the existing information-centric networking (ICN) cache strategy is irrational,and there exists the problem of invalid caching and homogeneous caching.In light of this,this paper proposed a caching and replacing strategy in ICN based on content popularity and community importance.In this strategy,content popularity and community importance of node are combined to select caching nodes,and the contents with different popularities are cached discretely in nodes with different community importance,so as to make the spatial distribution of content be reasonable,thus improving the diversification of caching contents.Meanwhile,the replacing strategy based on local popularity in a community is propitious to optimize the temporal distribution of caching content,so that the spatial distribution of content can be adjusted dynamically.The experimental results show that the proposed strategy can effectively reduce the average response time of user interest and improve cache hit rate and cache difference in the whole network.

Key words: Cache, Content popularity, Information-centric networking, Node importance

CLC Number: 

  • TP393
[1]BACHER F,RAINER B,HELLWAGNER H.Towards controller-aided multimedia dissemination in Named Data Networking[C]∥2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW).New York:IEEE,2015:1-6.
[2]XIULEI W,MING C,CHAO H,et al.SDICN:A software defined deployable framework of information centric networking[J].China Communications,2016,13(3):53-65.
[3]CHARPINEL S,SANTOS C A S,VIEIRA A B,et al.SDCCN:A Novel Software Defined Content-Centric Networking Approach[C]∥2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA).New York:IEEE,2016:87-94.
[4]ZHANG G Q,LI Y,LIN T,et al.Survey of in-network caching techniques in information-centric networks[J].Journal of Software,2014,25(1):154-175.(in Chinese)
[5]GHODSI A,SHENKER S,KOPONEN T,et al.Information-centric networking:seeing the forest for the trees[C]∥Procee-dings of the 10th ACM Workshop on Hot Topics in Networks.ACM,2011.
[6]EUM S,NAKAUCHI K,MURATA M,et al.CATT:potential based routing with content caching for ICN[C]∥Proceedings of the Second Edition of the ICN Workshop on Information-Centric Networking.ACM,2012:49-54.
[7]SAINO L,PSARAS I,PAVLOU G.Hashing routing scheme for information-centric networking[C]∥Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking.ACM,2013:27-32.
[8]CHAI W,HE D,PSARAS I,et al.Cache less for more in information-centric networks(extended version)[J].Computer Communications,2013,36(7):758-770.
[9]WANG Y,LEE K,VENKATARAMAN B,et al.Advertisingcached contents in the control plane:Necessity and feasibility[C]∥Proceedings of 2012 IEEE Conference on Computer Communications Workshops.IEEE,2012:286-291.
[10]SANG S,BI J,WU J.Collaborative caching based on hash-routing for information-centric networking[J].ACM Sigcomm Computer Communication Review,2013,43(4):535-536.
[11]SOURLAS V,FLEGKAS P,PASCHOS G,et al.Storage planning and replica assignment in content-centric publish/subscribe networks[J].Computer Networks,2011,55(18):4021-4032.
[12]ERIKSEN K A,SIMONSEN I,MASLOV S,et al.Modularity and extreme edges of the Internet [J].Physical Review Letters,2003,90(14):148701-148704.
[13]GE G D,GUO Y F,LIU C X,et al.Collaborative caching and routing scheme based on local request similarity in Named Data Networking[J].Journal of Electronics & Information Technology,2015,37(2):435-442.(in Chinese)
[14]LIU W X,YU S Z,HU X,et al.Selective caching in content-centric networking[J].Chinese Journal of Computers,2014,37(2):275-288.(in Chinese)
刘外喜,余顺争,胡晓,等.CCN 中选择性缓存机制的研究[J].计算机学报,2014,37(2):275-288.
[15]GIRVAN M,NEWMAN M E J.Community Structure in Social and Biological Networks[J].Proceedings of the National Academy of Sciences of the United States of America,2001,99(12):7821-7286.
[16]RAGHAVAN U N,ALBERT R,KUMARA S.Near linear time algorithm to detect community structures in large-scale networks[J].Physical Review E Statistical Nonlinear & Soft Matter Physics,2007,76(3 Pt 2):036106.
[17]NEWMAN M E.Finding community structure in networksusing the eigenvectors of matrices[J].Physical review E,2006,74(3 Pt 2):036104.
[18]RUI L L,PENG H,HUANG H Q,et al.Popularity and Centrality Based Selective Caching Scheme for Information-centric Networks[J].Journal of Electronics & Information Technology,2015,38(2):325-331.(in Chinese)
[19]ALEXANDER A,MOISEENKO I,ZHANG L X.ndnSIM:NDN simulator for NS-3 Named Data Networking (NDN) Project[R].2012.
[21]ZEGURA E,CALVERT K.Georgia tech Internet topology mo-dels[EB/OL].
[22]BRESLAU L,CAO P,FAN L,et al.Web caching and Zipf-like distributions:evidence and implications[C]∥18th Joint Con-ference of the IEEE Computer and Communications Societies.New York:IEEE,2002:126-134.
[23]ZHAO G F,XING Y,DUAN J,et al.Time-driven ICN caching mechanism in internet of things.Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition),2018,30(1):68-74.(in Chinese)
[1] MA Yuan-yuan, HAN Hua, QU Qian-qian. Importance Evaluation Algorithm Based on Node Intimate Degree [J]. Computer Science, 2021, 48(5): 140-146.
[2] LI Rui-xiang, MAO Ying-chi, HAO Shuai. Cache Management Method in Mobile Edge Computing Based on Approximate Matching [J]. Computer Science, 2021, 48(1): 96-102.
[3] CHI Hao-yu, CHEN Chang-bo. Prediction of Loop Tiling Size Based on Neural Network [J]. Computer Science, 2020, 47(8): 62-70.
[4] LU Yao, CHEN Kai-yan, WANG Yin-long and SHANG Qian-yi. L3 Cache Attack Against Last Round of Encryption AES Table Lookup Method [J]. Computer Science, 2020, 47(6A): 375-380.
[5] CHENG Yu, LIU Wei, SUN Tong-xin, WEI Zhi-gang, DU Wei. Design of Fault-tolerant L1 Cache Architecture at Near-threshold Voltage [J]. Computer Science, 2020, 47(4): 42-49.
[6] MENG Li-min, WANG Kun, ZHENG Zeng-qian, JIANG Wei. Architecture Strategy of D2D Content Edge Cache Based on Particle Swarm Optimization [J]. Computer Science, 2020, 47(11A): 345-348.
[7] LIU Wei, SUN Tong-xin, DU Wei. Access Pattern-oriented Cache Replacement Strategy for Hybrid Memory Architecture [J]. Computer Science, 2020, 47(10): 130-135.
[8] YANG Rui-jun, ZHU Ke, CHENG Yan. Database-level Web Cache Replacement Strategy Based on SVM Access Prediction Mechanism [J]. Computer Science, 2019, 46(6): 201-205.
[9] ZHANG Xin, WANG Hui-hui, YAN Pei, GUO Yang. Node Propagation Importance Algorithm for Multi-dimensional Complex Networks [J]. Computer Science, 2019, 46(11A): 348-353.
[10] ZHU Yan-na,WANG Dang-hui. Design of Cache Scheduling Policies Based on MLC STT-RAM [J]. Computer Science, 2018, 45(6A): 513-517.
[11] TU Yao-feng, LIU Hui, ZHANG Guo-liang and LIU Chun. Key Techniques of a Kind of Distributed Cache Systems and Their Applications [J]. Computer Science, 2018, 45(5): 156-162.
[12] YANG Dong-ju and FENG Kai. Distributed and Unified Authentication Optimization Mechanism Based on Cache [J]. Computer Science, 2018, 45(3): 300-304.
[13] TANG Xu, WANG Fei, LI Tong and ZHANG Peng. Research and Implementation of Real-time Exchange System in Data Center [J]. Computer Science, 2017, 44(Z6): 459-462.
[14] YE Xiao-qin, REN Yan-yang, SUN Ting and HENIGULI·Wumaier. Cache Location Decision and Operating Allocation Schema Based on SDN in WMN [J]. Computer Science, 2017, 44(8): 95-99.
[15] MENG Hong-tao, YU Song-ping, LIU Fang and XIAO Nong. Research on Memory Management and Cache Replacement Policies in Spark [J]. Computer Science, 2017, 44(6): 31-35.
Full text



No Suggested Reading articles found!