期刊文献+

ICN中的一种协作缓存机制 被引量:26

Scheme for Cooperative Caching in ICN
下载PDF
导出
摘要 为了克服现有Internet架构存在的众所周知的缺点,未来网络的研究成为热点.ICN(information-centricnetworking)在众多新架构中正逐渐被公认为最有前途的方案.它把传输的内容缓存到沿途的节点.高效的缓存机制是它的一个重要研究方面.为此,提出了一种在分布式缓存机制中嵌入中心式缓存决策的机制(content-awareplacement,discovery and replacement,简称APDR),它把内容的放置、发现、替换统一起来考虑,实现内容的有序缓存,提高网络的性能.APDR的主要思想是:Interest报文除了携带对内容的请求以外,还收集沿途各节点对该内容的潜在需求、空闲缓存等信息,使得Interest的汇聚点和目的地节点可以据此计算出一个缓存方案,并把该方案附加在Data报文上,通知返程途中的某些节点缓存该内容并设置指定的缓存时间.在多种实验条件下对APDR进行了仿真验证,结果表明,APDR可以改善网络性能,包括缓存命中率、接入代价、替换数量、转发效率以及缓存鲁棒性等;而且APDR的额外开销也不大. With the emergence of information-centric networking(ICN) in which in-networking caching distinguishes it from other Internet architecture,efficient caching becomes increasingly attractive,but remains of great challenge as current Web caching.This paper proposes a distributed scheme that is embedded with a locally central model,called APDR(i.e.,content-aware placement,discovery and replacement).In APDR,according to the information carried on Interest message,the destination of the Interest makes caching decision for the nodes along the path,including different time that the requested content will be cached in different nodes.Finally,the study evaluates the proposed scheme through extensive simulation experiments in terms of a wide range of performance metrics.The experiment results show that the scheme can yield a significant performance improvement over diverse operating environments,such as,cache hit ratio,average access cost,number of replacement,forwarding efficiency and cache robustness etc.At the same time,additional overhead of APDR is small.
出处 《软件学报》 EI CSCD 北大核心 2013年第8期1947-1962,共16页 Journal of Software
基金 国家自然科学基金(U0735002 60970146 61202271) 广东省自然科学基金(S2011040004068 S2012040007184)
关键词 ICN(information-centric networking) 内容放置 内容替换 承诺时间 差异化缓存 information-centric networking content placement content replacement commitment time differentiated caching
  • 相关文献

参考文献2

二级参考文献4

共引文献60

同被引文献150

  • 1张震波,杨鹤标,马振华.基于LRU算法的Web系统缓存机制[J].计算机工程,2006,32(19):68-70. 被引量:30
  • 2王会颖,贾瑞玉,章义刚,齐平.一种求解0-1背包问题的快速蚁群算法[J].计算机技术与发展,2007,17(1):104-107. 被引量:22
  • 3孙发军,吴昊.一个基于TOSSIM的异构传感器网络仿真方案[J].计算机仿真,2007,24(10):126-130. 被引量:6
  • 4[ EB/OL]. http://www. named-data. net/,2013.
  • 5Jacobson V,Smetters D K,Thomton J D,et al. Networking named content [ C ]. In:The 5th International Conference on Emerging Net- working EXperiments and Technologies ( CoNEXT ' 09 ), ACM, 2009:1-12.
  • 6Liu Wai-xi, Yu S, Qing H. Multisource dissemination in content- centric networking [ C ]. In: The 4th International Conference on Network of the Future ( NoF'2013 ), Korea: 2013.
  • 7Ahlswede R,Cai N,Li S Y R,et al. Network information flow[J]. Information Theory, IEEE Transactions on, 2000,46 ( 4 ) : 1204- 1216.
  • 8Lin Y, Liang B, Li B. Priority random linear codes in distributed storage systems[J]. Parallel and Distributed Systems, IEEE Trans- actions on. 2009, 20( 11 ) :1653-1667.
  • 9Dimakis A G,Godfrey P B,et al. Network coding for distributed storage systems [ J]. Information Theory, IEEE Transactions on. 2010, 56(9) : 4539-4551.
  • 10Dimakis A G,Ramchandran K,Wu Y,et al. A survey on network codes for distributed storage[ J]. Proceedings of the IEEE. 2011, 99(3) :476-489.

引证文献26

二级引证文献113

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部