Collaborative Cacbe Management Strategy Based on Ant-Colony Replacement Algoritbm in Named Data Networking

Lili Dong; Yong Wang; Yongqiang Dong; Peng Yang

doi:10.3969／j.issn.1000-0801.2014.09.007

您当前的位置：

首页 >

文章列表页 >

Collaborative Cacbe Management Strategy Based on Ant-Colony Replacement Algoritbm in Named Data Networking

Special topics: Information Center Network (ICN) | 更新时间：2024-06-05

- Collaborative Cacbe Management Strategy Based on Ant-Colony Replacement Algoritbm in Named Data Networking
- Telecommunications Science Vol. 30, Issue 9, Pages: 45-52(2014)
- 作者机构：
  
  1. 东南大学计算机科学与工程学院南京211189
  2. 东南大学计算机网络和信息集成教育部重点实验室南京211189
- 作者简介：
- 基金信息：
- DOI：10.3969／j.issn.1000-0801.2014.09.007
  CLC：
- Published Online：2014-09，
  
  Published：20 September 2014
- 稿件说明：
移动端阅览
Lili Dong, Yong Wang, Yongqiang Dong, et al. Collaborative Cacbe Management Strategy Based on Ant-Colony Replacement Algoritbm in Named Data Networking[J]. Telecommunications science, 2014, 30(9): 45-52.
DOI：

Lili Dong, Yong Wang, Yongqiang Dong, et al. Collaborative Cacbe Management Strategy Based on Ant-Colony Replacement Algoritbm in Named Data Networking[J]. Telecommunications science, 2014, 30(9): 45-52. DOI： 10.3969／j.issn.1000-0801.2014.09.007.

摘要

为提高NDN（命名数据网络）中的缓存利用率，提出了一种基于蚁群替换算法的邻居协作缓存管理（ACNCM）策略。首先将单节点的缓存替换问题，建模为0／1背包问题，并根据缓存数据的大小、使用频率以及邻居副本深度等信息定义本地存储内容的缓存价值，提出基于蚁群算法的缓存替换算法。然后利用邻域协作的思想，通过路由节点之间定期交换自身节点的缓存信息，对单个节点替换出去的缓存内容，选择邻居节点完成协作式缓存管理。实验结果表明，ACNCM策略在缓存命中率、网络开销和平均响应时延方面均优于现有方法。

Abstract

To improve the cache utilization in named data networking

a collaborative cache management strategy

named as ACNCM（ant-colony based neighbor cooperation cache management）

was proposed. The cache replacement problem in a single node was modeled as a 0／1 knapsack problem firstly

which could be well solved by an ant-colony replacement algorithm. To facilitate the execution of the algorithm

the inner content caching value was calculated by taking into account the size of the content

the access frequency of the content

and the status of neighboring cache copies. Once the to-be replaced content has been figured out

ACNCM was exploited to choose one available collaborative neighbor node to store the content

according to the regular exchange of caching information among neighboring nodes. The experimental results show that ACNCM outperforms the existing caching schemes in terms of cache hit rate

network overhead and the average response latency.

关键词

Keywords

references

Zhang L , Estrin D , Burke J , et al . Named Data Networking （NDN）Project . Technical Report NDN-0001, Xerox Palo Alto Research Center-PARC , 2010

Willick D L , Eager D L , Bunt R B . Disk cache replacement policies for network fileservers . Proceedings of the Distributed Computing Systems , California, USA 1993 : 2 ～ 11 .

张震波 , 杨鹤标 , 马振华 . 基于LRU 算法的Web 系统缓存机制 . 计算机工程 2006 , 32 ( 19 ): 68 ～ 70

Chrobak M , Noga J . LRU is better than FIFO . Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , San Francisco, California, USA 1998 : 78 ～ 81 .

Abrams M , Standridge C R , Abdulla G , et al . Removal policies in network caches for world-wide web documents . Proceedings of the ACM SIGCOMM , Stanford, CA, USA 1996 : 293 ～ 305

李韬 , 李玉宏 . 一种基于内容热度的NDN 缓存替换算法 . 中国科技论文在线 2012

张国强 , 李杨 , 林涛 , 等 . 信息中心网络中的内置缓存技术研究 . 软件学报 2014 , 25 ( 1 ): 154 ～ 175

Ming Z , Xu M , Wang D . Age-based cooperative caching in information-centric networks . Proceedings of the IEEE INFOCOM WKSHPS , Orlando, FL, USA 2012 : 268 ～ 273

刘外喜 , 余顺争 , 蔡君 , 等 . ICN 中的一种协作缓存机制 . 软件学报 2013 , 24 ( 8 ): 1947 ～ 1962

Eum S , Nakauchi K , Murata M , et al . CATT: potential based routing with content caching for ICN . Proceedings of the Second Edition of the ICN Workshop on Information-Centric Networking , Istanbul, Turkey 2012 : 49 ～ 54

Wang Y , Lee K , Venkataraman B , et al . Advertising cached contents in the control plane: necessity and feasibility . Proceedings of the IEEE INFOCOM WKSHPS , Orlando, FL, USA 2012 : 286 ～ 291

Wang J M , Zhang J , Bensaou B . Intra-AS cooperative caching for content-centric networks . Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking , Santa Barbara,CA 2013 : 61 ～ 66

王会莹 , 贾瑞玉 , 章义刚 , 等 . 一种求解0／1背包问题的快速蚁群算法 . 计算机技术与发展 2007 , 17 ( 1 ): 104 ～ 106

Stutzle T , Holger H H . Max-min ant system . Future Generation Computer System , 2000 , 16 ( 8 ): 889 ～ 914

Views

694

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An efficient routing and cache management algorithm based on interest-community for opportunity networks

A mobility support method based on ELM prediction for named data networking

MCKite: A Multi-Producer Multicast Scheme in Named Data Networking

Design and Implementation of DHT Algorithm for NDN

Content Distribution Mecbanisms of Named Data Networking

Related Author

Kunlong WANG

Xiufeng LI

Zhi REN

Hua QU

Yansong LI

Jihong ZHAO

Dongxu ZHAO

Jianlong ZHAO

Related Institution

School of Electronic and Information Engineering,Xi’an Jiaotong University

School of Software Engineering,Xi’an Jiaotong University

School of Communication and Information Engineering,Xi’an University of Posts and Telecommunication

Shenzhen Key Lab for Cloud Computing Technology＆Applications

Institute of Big Data Technologies, Peking University

⁰