当前位置:主页 > 科技论文 > 计算机论文 >

NDN中基于蚁群替换算法的邻居协作缓存管理策略

发布时间:2019-01-06 16:59
【摘要】:为提高NDN(命名数据网络)中的缓存利用率,提出了一种基于蚁群替换算法的邻居协作缓存管理(ACNCM)策略。首先将单节点的缓存替换问题,建模为0/1背包问题,并根据缓存数据的大小、使用频率以及邻居副本深度等信息定义本地存储内容的缓存价值,提出基于蚁群算法的缓存替换算法。然后利用邻域协作的思想,通过路由节点之间定期交换自身节点的缓存信息,对单个节点替换出去的缓存内容,选择邻居节点完成协作式缓存管理。实验结果表明,ACNCM策略在缓存命中率、网络开销和平均响应时延方面均优于现有方法。
[Abstract]:In order to improve the cache utilization in NDN (named data Network), a neighbor Cooperative Cache Management (ACNCM) strategy based on ant colony replacement algorithm is proposed. First, the single node cache replacement problem is modeled as 0 / 1 knapsack problem, and the cache value of local storage content is defined according to the size of cached data, frequency and depth of neighbor replica. A cache replacement algorithm based on ant colony algorithm is proposed. Then, by using the idea of neighborhood cooperation, the cache information of its own nodes is exchanged periodically between the routing nodes, and the cache content replaced by a single node is selected to complete the cooperative cache management. Experimental results show that the ACNCM strategy is superior to the existing methods in cache hit ratio, network overhead and average response delay.
【作者单位】: 东南大学计算机科学与工程学院;东南大学计算机网络和信息集成教育部重点实验室;
【基金】:国家高技术研究发展计划(“863”计划)基金资助项目(No.2013AA013503) 江苏省未来网络前瞻性研究基金资助项目(No.BY2013095-2-06)
【分类号】:TP333;TP18

【相似文献】

相关期刊论文 前10条

1 孟晓p,

本文编号:2403069


资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2403069.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户ecf2c***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com