一种基于节点中心性近似算法的ICN协作缓存策略

计算机与现代化 ›› 2021, Vol. 0 ›› Issue (04): 85-90.

一种基于节点中心性近似算法的ICN协作缓存策略

(1.贺州学院人工智能学院，广西贺州542899;2.贺州学院公共基础教学部，广西贺州542899)

出版日期:2021-04-22 发布日期:2021-04-25
作者简介:罗兰花(1982—)，女，江西宜丰人，讲师，硕士，研究方向：计算机网络，数据挖掘与分析，E-mail: 123497503@qq.com; 通信作者：袁淑丹(1981—)，女，讲师，硕士，研究方向：计算机网络，信息安全，E-mail: 123200357@qq.com; 何巧萍(1980—)，女，工程师，硕士，研究方向：计算智能，图像处理，E-mail: 7743820@qq.com。
基金资助:
国家自然科学基金资助项目(61540055); 广西高校中青年教师提升项目(2018KY0554, 2018KY0560)

An ICN Cooperative Cache Strategy Based on Node Centrality Approximation Algorithm

(1. School of Artificial Intelligence, Hezhou University, Hezhou 542899, China;
2. Department of Public Basic Teaching, Hezhou University, Hezhou 542899, China)

Online:2021-04-22 Published:2021-04-25

摘要/Abstract

摘要： 为了降低信息中心网络(Information Centric Networking, ICN)缓存冗余度和平均接入代价，提出一种基于节点中心性度量近似算法的协作缓存策略Centrality Metric Approximation Algorithm (CMAA)。考虑到精确计算最短路径的工作量对缓存性能的影响，CMAA策略利用最短路径近似估计值以提高节点中心性的计算效率，将节点中心性近似度量加权融合值、节点热度和缓存利用率三者作为缓存影响因子，计算得出兴趣包转发路径各节点的缓存优先级。在多种实验条件下对CMAA进行仿真实验，结果表明与LCE (Leave Copy Everywhere)和CLFM (Cache “Less for More”)相比，CMAA在平均缓存请求时延变化不大的情况下，可有效地提高缓存命中率，降低平均接入代价，从而改善缓存系统性能。

关键词: 信息中心网络, 缓存机制, 缓存命中率, 节点中心性

Abstract: In order to reduce the cache redundancy and average access cost of information centric networking (ICN), a collaborative cache strategy based on node centrality metric approximation algorithm (CMAA) is proposed. Considering the impact of the workload of accurately calculating the shortest path on the cache performance, CMAA uses the approximate estimation of the shortest path to improve the calculation efficiency of node centrality, and takes the weighted fusion value of the approximate measurement of node centrality, node heat and cache utilization rate as the cache impact factors to calculate the cache priority of each node in the interest packet forwarding path. The simulation results of CMAA under various experimental conditions show that compared with LCE (leave copy everywhere) and CLFM (cache “less for more”), CMAA can effectively improve the cache hit rate, reduce the average access cost and improve the performance of the cache system with little change in the average cache request delay.

Key words: information centric networking, caching mechanism, cache hit rate, node centrality

罗兰花, 袁淑丹, 何巧萍. 一种基于节点中心性近似算法的ICN协作缓存策略[J]. 计算机与现代化, 2021, 0(04): 85-90.

LUO Lan-hua, YUAN Shu-dan, HE Qiao-ping. An ICN Cooperative Cache Strategy Based on Node Centrality Approximation Algorithm[J]. Computer and Modernization, 2021, 0(04): 85-90.

参考文献

［1］段洁,邢媛,赵国锋. 信息中心网络中缓存技术研究综述［J］. 计算机工程与应用, 2018,54(2):1-10.
［2］ ZHANG L X, AFANASYEV A, BURKE J, et al. Named data networking［J］. ACM SIGCOMM Computer Communication Review, 2014,44(3):66-73.
［3］ FOTIOU N, NIKANDER P, TROSSEN D, et al. Developing information networking further: From PSIRP to PURSUIT［C］// Proceedings of the 2010 International Conference on Broadband Communications, Networks and Systems. 2010:1-13.
［4］ KOPONEN T, CHAWLA M, CHUN B G, et al. A data-oriented (and beyond) network architecture［C］// Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2007:181-192.
［5］ DANNEWITZ C, KUTSCHE D, OHLMAN B, et al. Network of information (NetInf): An information-centric networking architecture［J］. Computer Communications, 2013,36(7):721-735.
［6］ MING Z X, XU M W, WANG D. Age-based cooperative caching in information-centric networks［C］// Proceedings of the 31st IEEE International Conference on Computer Communications Workshop. 2012:268-273.
［7］ TSCHUDIN C, SIFALAKIS M. Named functions and cached computations［C］// Proceedings of the 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC). 2014:851-857.
［8］〖KG-*3〗VAN ADRICHEM N L M, KUIPERS F A. NDNFlow: Software-defined named data networking［C］// Proceedings of the 2015 1st IEEE Conference on Network Softwarization. 2015. DOI: 10.1109/NETSOFT.2015.7116131.
［9］ JACOBSON V, SMETTERS D K, THORNTON J D, et al. Networking named content［C］// Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. 2009. DOI: 10.1145/1658939.1658941.
［10］丁尧,郑烇,郭晨,等. 基于节点热度与缓存替换率的ICN协作缓存［J］. 计算机工程, 2018,44(2):56-60.
［11］LAOUTARIS N, CHE H, STAVRAKAKIS I. The LCD interconnection of LRU caches and its analysis［J］. Performance Evaluation, 2006,63(7):609-634.

［12］JACOBSON V, SMETTERS D K, THORNTON J D, et al. Networking named content［J］. Communications of the ACM, 2012,55(1):117-124.

［13］EUM S, NAKAUCHI K, MURATA M, et al. CATT: Potential based routing with content caching for ICN［C］// Proceedings of the 2nd Edition of the ICN Workshop on Information-Centric Networking. 2012:49-54.
［14］CHAI W K, HE D L, PSARAS I, et al. Cache “less for more” in information-centric networks (extended version)［J］. Computer Communications, 2013,36(7):758-770.
［15］DU Y X, GAO C, HU Y, et al. A new method of identifying influential nodes in complex networks based on TOPSIS［J］. Physica A: Statistical Mechanics and Its Applications, 2014,399:57-69.
［16］蔡岳平,刘军,樊欣唯. 基于节点中心性度量的内容中心网络缓存机制［J］. 通信学报, 2017,38(6):10-18.
［17］何宇,赵洪利,姚曜,等. 介数中心性和平均最短路径长度整合近似算法［J］. 复杂系统与复杂性科学, 2011,8(3):44-53.
［18］AFANASYEV A, MOISEENKO I, ZHANG L X. ndnSIM: NDN simulator for NS-3［R］. NDN Technical Report NDN-0005, 2012.
［19］BRESLAU L, CAO P, FAN L, et al. Web caching and Zipf-like distributions: Evidence and implications［C］// Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies. 1999:126-134.
［20］麻朴方,王劲林,尤佳莉. 一种基于马尔可夫模型的加速ICN路径收敛性的方法［J］. 计算机与现代化, 2020(1):28-33.
［21］张送柱,王兴伟,黄敏. 信息中心网络的内容流行度评估算法［J］. 小型微型计算机系统, 2020,41(7):1446-1450.
［22］李平,王雷,吴超群. POF-ICN架构中的边缘缓存研究［J］. 小型微型计算机系统, 2019,40(9):1820-1824.

[1]	杨昊, 高全力, 李雪花, 赵辉, 金帅, 徐国梁. 基于缓存价值的命名数据网络缓存优化策略[J]. 计算机与现代化, 2022, 0(10): 95-99.
[2]	陈广福, 连雁平, . 融合节点中心性和度相关聚类的有向网络链路预测[J]. 计算机与现代化, 2022, 0(08): 36-42.
[3]	吴上, 盛益强, 邓浩江, . 基于改进贪婪算法的测量节点选择优化方法[J]. 计算机与现代化, 2021, 0(04): 79-84.