期刊文献+

内容中心网络中基于内容迁移的协作缓存机制 被引量:2

Cooperative Caching Mechanism with Content Migration in Content-centric Networking
在线阅读 下载PDF
导出
摘要 内容中心网络(CCN)是为了适应未来网络通信模式的转变,提供对可扩展和高效内容获取的原生支持而提出一种新型的网络体系架构,内容缓存机制是其研究的关键问题之一。现有机制在缓存节点的选择时往往过于集中,缓存负载分布严重不均,大大降低了网络资源利用率以及系统的缓存性能。该文提出一种基于缓存迁移的协作缓存机制,首先在缓存节点选择时考虑节点的中心性保证内容尽可能缓存在位置更重要的节点。同时,在缓存压力过大时,通过可用缓存空间大小、缓存替换率以及网络连接的稳定性等信息选择合适的邻居节点进行缓存内容的转移,充分利用邻居资源实现负载分担。仿真结果表明该机制能有效地改善缓存负载在节点上分布的均衡性,提高缓存命中率和缓存资源利用率并降低平均接入代价。 Content-Centric Networking (CCN) is a new Internet architecture with native support for scalable and efficient content acquisition, which is proposed to accommodate the changes in future communication mode. Content caching is one of the key issues in CCN. In some existing work, the choice of caching nodes is over-focused on few special nodes, which results in an uneven distribution of cached contents. It greatly decreases the utilization of network resources and impairs the overall caching performance. In this paper, a Cooperative Caching Mechanism with Content Migration (CCMCM) is proposed. In this scheme, the centrality of node is considered in the selection of caching nodes to ensure that contents can be cached in the more important nodes as much as possible. When the cached contents are extensive, the caching node can transfer some contents to the appropriate neighbor according to the cache space available, the cache replacement rate and the connection stability between nodes. The aim is to fully utilize the resource of neighbor nodes and achieve effective load distribution. Simulation results show that the proposed scheme improves the load balance among caching nodes, increases the resource utilization and achieves high cache hit rate with low average access cost.
出处 《电子与信息学报》 EI CSCD 北大核心 2015年第11期2790-2794,共5页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61402541 61103204)~~
关键词 内容中心网络 协作缓存 负载均衡 内容迁移 Content-Centric Networking (CCN) Cooperative caching Load balance Content migration
作者简介 罗熹:女,1980年生,博士生,研究方向为新型网络体系结构设计、内容中心网络. 安莹:男,1980年生,讲师,在站博士后,研究方向为新型网络体系结构设计、内容中心网络、延迟容忍网络等.通信作者:安莹 anying@csu.edu.cn 王建新:男,1969年生,教授,博士生导师,研究方向为网络优化理论、参数计算理论、生物信息学等. 刘耀:男,1976年生,讲师,博士,研究方向为延迟容忍网络、社会网络等.
  • 相关文献

参考文献13

  • 1Koponen T, Chawla M, Chun B G, et al.. A data-oriented (and beyond) network architecture[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(4): 181-192.
  • 2Ahlgren B, Dannewitz C, lmbrenda C, et al.. A survey of information-centric networking[J]. IEEE Communications Magazine, 2012, 50(7): 26-36.
  • 3Jacobson V, Smetters D K, Thornton J D, et al.. Networking named content[J]. Communications of the A CM, 2012, 55(1): 117-124.
  • 4Laoutaris N, Syntila S, and Stavrakakis I. Meta algorithms for hierarchical web caches[C]. Proceedings of the IEEE International Performance Computing and Communications Conference (IEEE IPCCC), Phoenix, 2004: 445-452.
  • 5Cho K, Lee M, Park K, et al.. WAVE: popularity-based and collaborative in-network caching for contentoriented networks[C]. Proceedings of the IEEE INFOCOM Workshop on NOMEN, Orlando, FL, 2012: 316-321.
  • 6Ming Z, Xu M, and Wang D. Age-based cooperative caching in information-centric network[C]. Proceedings of the 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, 2014: 1-8.
  • 7葛国栋,郭云飞,刘彩霞,兰巨龙.命名数据网络中基于内容请求相关性的协作缓存算法[J].电子与信息学报,2014,36(12):2795-2801. 被引量:7
  • 8Wang L, Bayhan S, and Kangasharju J. Optimal chunking and partial caching in information-centric networks[J]. Computer Communications, 2015, 61: 48-57.
  • 9Qian H, Muqing W, Dongyang W, et al.. Lifetime-based greedy caching approach for content-centric networking[C]. Proceedings of the 21st International Conference on Telecommunications (ICT), Lisbon, Portugal, 2014: 426-430.
  • 10Chal W K, He D, Psaras I, et al.. Cache "less for more" in information-centric networks (extended version) [J]. Computer Communications, 2013, 36(7): 758-770.

二级参考文献31

  • 1Ahlgren B, Dannewitz C, Imbrenda C, et al. A survey ofinformation-centric networking[J]. IEEE CommunicationMagazine' 2012, 50(7): 26-36.
  • 2Jacobson V,Smetters D K, Thornton J D, et al. Networkingnamed content [J]. Communications of the ACM^ 2012, 55(1):117-124.
  • 3Chiocchetti R, Perino D, Carofiglio G, et al.. INFORM: adynamic Interest Forwarding Mechanism for InformationCentric Networking[C]. ACM SIGCOMM Workshop onInformation-Centric Networking, Hong Kong, China, 2013:9-14.
  • 4Eum S, Nakauchi K, Murata M, et al. CATT: potential basedrouting with content caching for ICN[C]. ACM SIGCOMMWorkshop on Information-Centric Networking, Helsinki,Finland, 2012: 49-54.
  • 5Laoutaris N, Syntila S, and Stavrakakis I. Meta algorithmsfor hierarchical web caches [C]. IEEE InternationalConference on Performance, Computing, and Commu-nications, Phoenix, USA, 2004: 445-452.
  • 6Chai W K, He D, Psaras I, et al. Cache “less for more” ininformation-centric networks[C]. Proceedings of IFIP 6Networking Conference, Prague, Czech, 2012: 27-40.
  • 7Psaras I, Chai W K, and Pavlou G. Probabilistic in-networkcaching for information-centric networks[C]. ACMSIGCOMM Workshop on Information-Centric Networking,Helsinki, Finland, 2012: 55-60.
  • 8Ming Z X, Xu M W, and Wang D. Age-Based cooperativecaching in information-centric networks[C]. IEEE INFOCOM,Orlando, USA, 2012: 268-273.
  • 9Cho K, Lee M, Park K, et al" WAVE: popularity-based andcollaborative in-network caching for content-orientedNetworks[C], IEEE INFOCOM Workshop on EmergingDesign Choices in Name-Oriented Networking, Orlando, USA,20X2: 316-321.
  • 10Zhang G Q, Li Y, and Lin T. Caching in information centricnetworking: a survey [J]. Computer Networks, 2013, 57(16),3128-3141.

共引文献39

同被引文献9

引证文献2

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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