期刊文献+

CCN中选择性缓存机制的研究 被引量:19

Selective Caching in Content-Centric Networking
下载PDF
导出
摘要 现有Internet架构存在着众所周知的缺点,未来网络架构的研究成为了热点.其中,CCN(Content-Centric Networking)在众多新架构中正逐渐被大家认为是最有前途的方案之一,它要求网络中的每一节点都要有缓存功能.所以,研究高效的缓存机制就成为实现CCN预期目标的关键.针对CCN现有缓存机制中存在的"无序缓存"的问题,文中提出了选择性缓存机制SC(Selective Caching).它根据用户的潜在需求和内容的流行规律,只在必要的节点上选择性地(而不是沿着内容传输路径处处地)缓存.同时,采用带宽换缓存的思想,利用链路的冗余带宽,将内容分流到相邻节点缓存,进一步提升缓存效率.我们首先提出了缓存空间消耗的理论分析模型,然后在多种实验条件下对SC进行了验证,实验结果表明SC可以提高网络的缓存效率和性能,同时SC的通信、计算、状态记忆等额外开销也都很小. Addressing the well known challenges of current Internet, great expectations are held on Content-Centric Networking (CCN). In CCN, in-networking caching is the key difference from other Internet architectures, so the researching of efficient caching strategy becomes increasingly attractive but remains some great challenges. To address the disorderly caching of current caching strategy, this paper proposes a novel scheme--Selective Caching (SC). In SC, following the consumer's potential demand and the rise and fall of content popularity, content is cached only by some necessary nodes instead of all nodes on the content transmission path. At the same time, in accordance with the bandwidth for-cache, content can be pushed to the adjacent node with more cache. We firstly propose a theoretical model to evaluate cache size consumed. Finally, we evaluate the proposed scheme through extensive simulation experiments in terms of a wide range of performance metrics. The experiment results show that our proposed scheme can yield a steady improvement of network performance and caching efficiency over diverse operating environments. At the same time, SC buys caching performance improvement with negligible overhead.
出处 《计算机学报》 EI CSCD 北大核心 2014年第2期275-288,共14页 Chinese Journal of Computers
基金 国家自然科学基金-广东联合基金重点项目(U0735002) 国家自然科学基金(60970146 61202271) 广东省自然科学基金(S2011040004068 S2012040007184 S2013040014339 S2013010013511)资助~~
关键词 内容中心网络(CCN) 选择性缓存 内容放置 带宽换缓存中图法 for-cache content-centric networking(CCN) selective caching content placement bandwidth
  • 相关文献

参考文献4

二级参考文献13

  • 1李文中,顾铁成,李春洪,陆桑璐,陈道蓄.GCaching——一种网格协同缓存系统[J].计算机研究与发展,2004,41(12):2211-2217. 被引量:3
  • 2凌波,王晓宇,周傲英,Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究[J].计算机学报,2005,28(2):170-178. 被引量:19
  • 3Pallis G, Vakali A. Insight and perspectives for content deliv- ery networks[J]. Communications of the ACM, 2006, 49(1): 101-106.
  • 4Jacobson V, Smetters D K, Thronton J D, et al. Networknamed content[C]//Proceedings of the 5th International Con- ference on Emerging Networking Experiments and Technol- ogies (CoNEXT '09), Rome, Italy, 2009. New York, N-Y, USA: ACM, 2009: 1-12.
  • 5Jacobson V, Thomton J, Plass M, et al. Project CCNxTM[CP/ OL]. [2012-01 ]. http://www.ccnx.org.
  • 6Jacobson V, Smetters D K, Briggs N H, et al. VoCCN: voice- over content centric networks[C]//Proceedings of the 2009 Workshop on Re-architecting the Internet (ReArch '09), Rome, Italy, 2009. New York, NY, USA: ACM, 2009: 1-6.
  • 7Shanbhag S, Schwan N, Rimac I, et al. SoCCeR: services over content-centric routing[C]//Proceedings of the 2011 ACM SIGCOMM Workshop on Information-Centric Networking (ICN '11), Toronto, Canada, 2011. New York, NY, USA: ACM,2011: 62-67.
  • 8Watts D J, Strogatz S H. Collective dynamics of ' small-world' networks[J]. Nature, 1988, 393(6): 440-442.
  • 9Fonsecaf R, Almeida V, Crovella M. Locality in a Web of streams[J]. Communications of the ACM, 2005, 48(1): 82-88.
  • 10Zegura E, Calvert K, Bhattacharjee S. How to model an inter- network[C]//Proceedings of the 15th Annual Joint Confer- ence of the IEEE Computer Societies (INFOCOM '96), San Francisco, CA, USA, 1996. Washington, DC, USA: IEEE Computer Society, 1996: 594-602.

共引文献66

同被引文献118

  • 1颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222. 被引量:68
  • 2于红,王秀坤,孟军.用有序FP-tree挖掘最大频繁项集[J].控制与决策,2007,22(5):520-524. 被引量:7
  • 3孙发军,吴昊.一个基于TOSSIM的异构传感器网络仿真方案[J].计算机仿真,2007,24(10):126-130. 被引量:6
  • 4Wang J. A survey of web caching schemes for the Internet [J 1. ACM SIGCOMM Computer Communication Review, 1999,29 ( 5 ) : 36 -46.
  • 5Rossi D, Rossini G. Caching performance of content centric networks under multi-path routing (and more) [R]. Is. 1. ] : [ s. n. ] ,2011.
  • 6Per/no D,Varvello M. A reality check for content centr/c net- working[C ]//Proc of ACM SIGCOMM 1CN Workshop. [ s. 1. ] :Is. n. ] ,2011:44-49.
  • 7Muscariello L, Caroglio G, Gallo M. Bandwidth and storage sharing performance in information centric networking[ C]// Proc of ACM SIGCOMMICN workshop. [ s. 1. ] : [ s. n. ], 2011:26-31.
  • 8XYLOMENOS VERVERIDIS C N, SIRIS V A, et al. A survey of information-centric networking research[J]. Communications Surveys & Tutorials, 2014, 16(2): 1024-1049.
  • 9JACOBSON V, SMETTERS D K, THORNTON J D, et al. Network- ing named content[J]. Communications of the ACM, 2012, 55(1): 117-124.
  • 10BORST S, GUPTA V, WALID A. Distributed caching algorithms for content distribution networks[C]//The IEEE INFOCOM. San Diego, CA, c2010: 1-9.

引证文献19

二级引证文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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