Abstract：A cache strategy based on community nodes division and content popularity(CCNCP) was proposed to improve content availability due to the limit capacity of the routers in named-data networking(NDN). The regions were divided according to the topology structure, and the importance of nodes was comprehensively measured to select local central nodes and global central nodes. The contents with different popularities were reasonably cached in nodes with different importance. The classic GN algorithm was used to obtain partition communities. The centrality indexes of degree centrality, closeness centrality and betweenness centrality were defined. The system model was established, and the cache strategy was provided. To evaluate the performance of the scheme, the Icarus was used to simulate CCNCP and other alternative strategies. The simulation experiment was implemented on two topologies of Zachary karate club network and GARR of real topology. The results show that CCNCP performs better in both topologies. When the parameter S is equal to 0.25, the cache hit ratio, latency and path stretch ratio of CCNCP and the second best cache strategy ProbCache are 30.9% and 26.8%, 52.9 and 56.2 ms, 0.584 and 0.617, respectively, and the former is 4.1% higher, 5.9% lower and 5.3% lower than the latter, which indicates that the proposed CCNCP has significant salient performance over the current typical strategies in all three metrics.
XYLOMENOS G, VERVERIDIS C N, SIRIS V A, et al. A survey of information-centric networking research[J]. IEEE Communications Surveys & Tutorials, 2014, 16(2):1024-1049.
［2］
LAOUTARIS N, SYNTILA S, STAVRAKAKIS I. Meta algorithms for hierarchical web caches[C]∥Proceedings of the 23rd IEEE International Performance, Computing, and Communications Conference. Piscataway：IEEE, 2004: 445-452.
［3］
LAOUTARIS N, CHE H, STAVRAKAKIS I. The LCD interconnection of LRU caches and its analysis[J]. Performance Evaluation, 2006, 63(7): 609-634.
［4］
PSARAS I, CHAI W K, PAVLOU G. Probabilistic in-network caching for information-centric networks[C]∥Proceedings of the 2nd ACM SIGCOMM 2012 Information-Centric Networking Workshop. Helsinki：ACM, 2012: 55-60.
［5］
CHAI W K, HE D, PSARAS I, et al. Cache "less for more" in information-centric networks (extended version)[J]. Computer Communications, 2013, 36(7):758-770.
［6］
BERNARDINI C, SILVERSTON T, FESTOR O. MPC: popularity-based caching strategy for content centric networks[C]∥Proceedings of the 2013 IEEE International Conference on Communications. Piscataway:IEEE, 2013: 3619-3623.
ZHAO G F，XING Y，DUAN J，et al. Time-driven ICN caching mechanism in internet of things[J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2018,30(1):68-74. (in Chinese)
［8］
GUI Y Q, CHEN Y K. A cache placement strategy based on compound popularity in named data networking[J]. IEEE Access, 2020, 8: 196002-196012.
GUO C，ZHENG Q，DING Y, et al. Cache scheme based on content popularity and node betweenness in named data networking[J]. Computer Systems & Applications,2017,26(12):165-169. (in Chinese)
ZHANG G, HU Y X, HUANG W W, et al. Coordinated caching scheme based on popular content awareness and tracking[J]. Journal on Communications,2017,38(2):132-142.(in Chinese)
ZHANG L，HAN M，ZHENG Y, et al. Consumer-based proximity caching algorithm for named data networking[J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2018,30(1):90-95.(in Chinese)
［12］
SAINO L, PSARAS I, PAVLOU G. Icarus: a caching simulator for information centric networking (ICN)[C]∥Proceedings of the 7th International Conference on Simulation Tools and Techniques.[S.l.]:ICST，2014：66-75.
［13］
NEWMAN M E J, GIRVAN M. Finding and evaluating community structure in networks[J]. Physical Review E,doi: 10.1103/PhysRevE.69.026113.
［14］
PERRY M B. The exponentially weighted moving ave-rage[J]. Journal of Quality Technology,1986, 18(4): 203-210.
［15］
MONTGOMERY D C, JOHNSON L A, GARDINER J S. Forecasting and Time Series Analysis[M].New York：McGraw-Hill Companies, 1990.
2023, Vol. 44 
