命名数据网络中基于数据请求代价与流行度的动态替换策略

计算机应用 ›› 2014, Vol. 34 ›› Issue (12): 3369-3372.

• 网络与通信 • 下一篇

命名数据网络中基于数据请求代价与流行度的动态替换策略

黄胜,滕明埝,陈胜蓝,刘焕淋,向劲松

重庆邮电大学光纤通信技术重点实验室,重庆 400065

收稿日期:2014-06-19 修回日期:2014-08-09 出版日期:2014-12-01 发布日期:2014-12-31
通讯作者: 滕明埝
作者简介:黄胜(1974-),男,湖北英山人,教授,博士,主要研究方向:未来互联网体系结构、计算机网络、光网络；滕明埝(1991-),男,重庆人,硕士研究生,主要研究方向:未来互联网数据存储策略；陈胜蓝(1986-),男,重庆人,硕士研究生,主要研究方向:未来互联网数据存储策略；刘焕淋(1970-),女,重庆人,教授,博士,主要研究方向:宽带网络技术、光纤通信、光交换技术；向劲松(1975-),男,重庆人,副教授,博士,主要研究方向:空间光通信。
基金资助:
国家自然科学基金资助项目;重庆市自然科学基金资助项目;重庆市教委科学技术研究项目

Dynamical replacement policy based on cost and popularity in named data networking

HUANG Sheng,TENG Mingnian,CHEN Shenglan,LIU Huanlin,XIANG Jinsong

Key Laboratory of Optical Fiber Communication Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

Received:2014-06-19 Revised:2014-08-09 Online:2014-12-01 Published:2014-12-31
Contact: TENG Mingnian

摘要/Abstract

摘要：

针对怎样高效地对命名数据网络(NDN)缓存中的数据进行替换的问题,提出了一种综合考虑数据流行度与数据请求代价的数据替换策略。该策略根据数据的请求时间间隔动态地分配数据流行度因子与数据请求代价因子的比重,使节点缓存高流行度与高请求代价的数据。当用户下次请求数据时能够从本节点获取,降低数据请求的响应时间并减少链路拥塞。仿真结果表明,本策略能够有效提高网内存储命中率,降低用户获取数据的时间以及缩短用户获取数据的距离。

Abstract:

In view of the problem that data for Named Data Networking (NDN) cache is replaced efficiently, a new replacement policy that considered popularity and request cost of data was proposed in this paper. It dynamically allocated proportion of popularity factor and request cost factor according to the interval time between the two requests of the same data. Therefore, nodes would cache data with high popularity and request cost. Users could get data from local node when requesting data next time, so it could reduce the response time of data request and reduce link congestion. The simulation results show that the proposed replacement policy can efficiently improve the in-network hit rate, reduce the delay and distance for users to fetch data.

中图分类号:

TP393

黄胜滕明埝陈胜蓝刘焕淋向劲松. 命名数据网络中基于数据请求代价与流行度的动态替换策略[J]. 计算机应用, 2014, 34(12): 3369-3372.

HUANG Sheng TENG Mingnian CHEN Shenglan LIU Huanlin XIANG Jinsong. Dynamical replacement policy based on cost and popularity in named data networking[J]. Journal of Computer Applications, 2014, 34(12): 3369-3372.

参考文献

［1］XIE G, ZHANG Y, LI Z, et al. A survey on future Internet architecture［J］. Chinese Journal of Computers,2012,35(6):1109-1119.(谢高岗, 张玉军, 李振宇, 等. 未来互联网体系结构研究综述［J］. 计算机学报, 2012, 35(6): 1109-1119.)
［2］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. New York: ACM, 2009: 1-12.
［3］JACOBSON V, SMETTERS D K, THORNTON J D, et al. Networking named content［J］. Communications of the ACM, 2012, 55(1):117-124.
［4］ZHANG L, ESTRIN D, BURKE J, et al. Named data networking project, NDN-0001［R/OL］.[2014-06-27]. http://named-data.net/wp-content/uploads/TR001ndn-proj.pdf.
［5］PSARAS I, CLEGG R G, LANDA R, et al. Modeling and evaluation of CCN-caching trees［C］// Proceedings of the 10th International IFIP TC 6 Conference on Networking. Berlin: Springer, 2011: 78-91.
［6］CAROFIGLIO G, GALLO M, MUSCARIELLO L, et al. Modeling data transfer in content-centric networking［C］// Proceedings of the 23rd International Teletraffic Congress. Piscataway: IEEE, 2011: 111-118.
［7］CAROFIGLIO G, GALLO M, MUSCARIELLO L. Bandwidth and storage sharing performance in information centric networking［C］// Proceedings of the 2011 ACM SIGCOMM Conference. New York: ACM, 2011: 1-6.
［8］CAO P, IRANI S. Cost-aware WWW proxy caching algorithms［C］// Proceedings of the USENIX Symposium on Internet Technologies and Systems. Berkeley: USENIX Association, 1997: 193-206.
［9］WANG J M, BENSAOU B. Improving content-centric networks performance with progressive, diversity-load driven caching［C］// Proceedings of the 2012 1st IEEE International Conference on Communications in China. Piscataway: IEEE, 2012: 85-90.
［10］CHEN X, FAN Q, YIN H. Caching in information-centric networking: from a content delivery path perspective［C］// Proceedings of the 2013 9th International Conference on Innovations in Information Technology. Piscataway: IEEE, 2013: 48-53.
［11］AHLGREN B, DANNEWITZ C, IMBRENDA C, et al. A survey of information-centric networking［J］.IEEE Communications Magazine, 2012, 50(7): 26-36.
［12］XYLOMENOS G, VERVERIDIS C, SIRIS V, et al. A survey of information-centric networking research［J］. IEEE Communications Surveys and Tutorials, 2013, 16(2): 1024-1049.
［13］AFANASYEV A, MOISEENKO I, ZHANG L. NDNSIM: NDN simulator for NS-3, NDN-0005［R/OL］.[2014-06-27]. http://named-data.net/publications/techreports/trndnsim/.

[1]	毕文婷林海涛张立群. 基于多阶段演化信号博弈模型的移动目标防御决策算法[J]. 计算机应用, 0, (): 0-0.
[2]	朱玉娜, 张玉涛, 闫少阁, 范钰丹, 陈韩托. 基于半监督子空间聚类的协议识别方法[J]. 计算机应用, 2021, 41(10): 2900-2904.
[3]	杨书新许景峰. 基于反向影响采样的积极影响力最大化[J]. 计算机应用, 0, (): 0-0.
[4]	郭棉, 张锦友. 移动边缘计算环境中面向机器学习的计算迁移策略[J]. 计算机应用, 2021, 41(9): 2639-2645.
[5]	倪萍, 陈伟. 基于模糊测试的反射型跨站脚本漏洞检测[J]. 计算机应用, 2021, 41(9): 2594-2601.
[6]	曾续玲李陶深巩健杜利俊. 无线供能移动边缘计算系统的安全卸载优化[J]. 计算机应用, 0, (): 0-0.
[7]	谢家贵李志平金键. 基于星火区块链的跨链机制[J]. 计算机应用, 0, (): 0-0.
[8]	张立群林海涛郇文明毕文婷. 基于OpenFlow的软件定义网络流规则冲突检测系统的设计与仿真[J]. 计算机应用, 0, (): 0-0.
[9]	赖涵光李清江勇. 基于场景变化的传输控制协议拥塞控制切换方案[J]. 计算机应用, 0, (): 0-0.
[10]	陈葳葳, 曹利, 顾翔. 基于区块链的车联网电子取证模型[J]. 计算机应用, 2021, 41(7): 1989-1995.
[11]	肖跃雷, 邓小凡. 基于证书的有线局域网安全关联方案改进与分析[J]. 计算机应用, 2021, 41(7): 1970-1976.
[12]	邓伟健陈曦. 基于时变资源的容器化虚拟网络映射算法[J]. 计算机应用, 0, (): 0-0.
[13]	董文涛, 李卓, 陈昕. 基于联邦学习的在线短视频内容分发策略[J]. 计算机应用, 2021, 41(6): 1551-1556.
[14]	施安妮, 李陶深, 王哲, 何璐. 基于缓存辅助的全双工无线携能通信系统的中继选择策略[J]. 计算机应用, 2021, 41(6): 1539-1545.
[15]	葛丽娜, 胡雨谷, 张桂芬, 陈园园. 云计算环境基于客体属性匹配的逆向混合访问控制方案[J]. 计算机应用, 2021, 41(6): 1604-1610.

命名数据网络中基于数据请求代价与流行度的动态替换策略

Dynamical replacement policy based on cost and popularity in named data networking

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics