| 引用本文: | 王兴伟,王子健,李福亮,等.信息中心网络缓存节点位置选择算法.[J].国防科技大学学报,2019,41(1):152-160.[点击复制] |
| WANG Xingwei,WANG Zijian,LI Fuliang,et al.Cache location selected algorithm for information-centric networking[J].Journal of National University of Defense Technology,2019,41(1):152-160[点击复制] |
|
| |
|
|
| 本文已被：浏览 6299次 下载 5975次 |
| 信息中心网络缓存节点位置选择算法 |
| 王兴伟1, 王子健1, 李福亮2, 黄敏3 |
|
(1. 东北大学 软件学院， 辽宁 沈阳 110004;2. 东北大学 计算机科学与工程学院， 辽宁 沈阳 110004;3. 东北大学 信息科学与工程学院， 辽宁 沈阳 110004)
|
| 摘要: |
| 信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性，引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题，分别从用户、服务提供商和网络运营商的角度出发，以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型，并将二者结合为帕累托模型；基于帕累托求解方法中数学规划法的思想，详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面，所提缓存节点选择算法优于ICN的默认缓存机制；在网络费用开销方面，所提算法更适用于只有少数内容较为流行的网络中，而在所有内容都流行的情况下，ICN中默认的“遍地缓存”机制更为适宜。 |
| 关键词: 信息中心网络 缓存节点位置选择 帕累托模型 数学规划法 内容流行度 |
| DOI：10.11887/j.cn.201901021 |
| 投稿日期：2017-11-10 |
| 基金项目:国家自然科学基金资助项目（61572123）；国家杰出青年科学基金资助项目（71325002）；教育部-中国移动科研基金资助项目（MCM20160201） |
|
| Cache location selected algorithm for information-centric networking |
| WANG Xingwei1, WANG Zijian1, LI Fuliang2, HUANG Min3 |
|
(1. College of Software, Northeastern University, Shenyang 110004, China;2. School of Computer Science and Engineering, Northeastern University, Shenyang 110004, China;3. College of Information Science and Engineering, Northeastern University, Shenyang 110004, China)
|
| Abstract: |
| The cache ubiquity feature in ICN (information-centric networking) causes many problems such as higher data duplication rate, underutilization of cache space, etc. To solve such problems, the benefits of multiple network roles were considered. From the views of user-service provider and network operator, two single-objective optimization models were established respectively, aiming at minimizing the network traffic and the network expense, which were merged into the Pareto model. The proposed cache location selected algorithm was described based on the mathematical programming method of Pareto. Simulation results show that the proposed algorithm outperforms the default cache mechanism of ICN in terms of traffic cost-effective. In terms of network expense, the proposed algorithm is more applicable to ICN when there are a few popular contents. However, when all contents are popular, the default mechanism of “cache everywhere” in ICN is more applicable. |
| Keywords: information-centric networking cache location selected Pareto model mathematical programming content popularity |
|
|
|
|
|
