基于层次划分的CCN网络缓存存储策略

李俊; 冯宗明; 吴海博; 智江

doi:10.11959/j.issn.1000-436x.2016005

您当前的位置：

首页 >

文章列表页 >

基于层次划分的CCN网络缓存存储策略

学术论文 | 更新时间：2024-06-05

- 基于层次划分的CCN网络缓存存储策略
- Hierarchical division-based cache storage strategy in content-centric networking
- 通信学报 2016年37卷第1期页码：36-41
- 作者机构：
  
  1. 中国科学院计算机网络信息中心，北京 100190
  2. 中国科学院大学，北京 100049
- 作者简介：
  
  [ "李俊（1968-），男，安徽桐城人，博士，中国科学院计算机网络信息中心研究员、博士生导师，主要研究方向为下一代互联网、网络安全等。" ]
  [ "冯宗明（1989-），男，安徽马鞍山人，中国科学院大学硕士生，主要研究方向为下一代互联网关键技术。" ]
  [ "吴海博（1981-），男，山东泰安人，博士，中国科学院计算机网络信息中心助理研究员，主要研究方向为下一代互联网缓存技术。" ]
  [ "智江（1983-），男，山西太原人，中国科学院大学博士生，主要研究方向为下一代互联网关键技术。" ]
- 基金信息：
  
  中国科学院计算机网络信息中心“135”规划重点培育方向专项基金资助项目;Five Top Priorities of“One-Three-Five”Strategic Planning, CNIC(CNIC_PY-1401);国家重点基础研究发展计划（“973”计划）基金资助项目;The National Basic Research Program of China (973 Program)(2012CB315803);中国科学院知识创新工程青年人才领域基金资助项目;Knowledge Innovation Program, CAS(CNIC_QN_1303);中国科学院知识创新工程青年人才领域基金资助项目;Knowledge Innovation Program, CAS(CNIC_QN_1508);中国科学院计算机网络信息中心主任基金资助项目;Director Fund Project of CNIC, CAS(CNIC_ZR_201204)
- DOI：10.11959/j.issn.1000-436x.2016005
  中图分类号： TP393
- 网络出版日期：2016-01，
  
  纸质出版日期：2016-01-25
- 稿件说明：
移动端阅览
李俊, 冯宗明, 吴海博, 等. 基于层次划分的CCN网络缓存存储策略[J]. 通信学报, 2016,37(1):36-41.

Jun LI, ming FENGZong, bo WUHai, et al. Hierarchical division-based cache storage strategy in content-centric networking[J]. Journal on communications, 2016, 37(1): 36-41.
李俊, 冯宗明, 吴海博, 等. 基于层次划分的CCN网络缓存存储策略[J]. 通信学报, 2016,37(1):36-41. DOI： 10.11959/j.issn.1000-436x.2016005.

Jun LI, ming FENGZong, bo WUHai, et al. Hierarchical division-based cache storage strategy in content-centric networking[J]. Journal on communications, 2016, 37(1): 36-41. DOI： 10.11959/j.issn.1000-436x.2016005.

摘要

针对如何提高内容中心网络网内缓存性能的问题，提出一种基于层次划分的轻量协作的缓存存储策略。该策略通过Interest分组、Data分组以及路由器本地PIT表三者的协作把内容划分为多种优先级层级，使不同内容缓存在沿途的不同路由器。实验证明该策略可以有效地减少访问跳数，提高平均缓存命中率，降低服务器负载。

Abstract

For the issue of improving the performance of in-network cache in content-centric networking

a hierarchical division-based lightweight collaboration cache storage strategy was proposed. According to the strategy

content was grouped into different hierarchies by the cooperation Interest package

Data package and the local PIT of routers

so that the contents could be cached in different nodes along the delivery path. The performance of the scheme was eva-luated by comparing with the well-known schemes through simulation. Experimental results indicate that the scheme has good performance in reducing access hops

increasing the average cache hit ratio and reducing the server load.

关键词

Keywords

references

ACOBSON V , SMETTERS D K , THORNTON J D , et al . Networking named content [C ] // The 5th International Conference on Emerging Networking Experiments and Technologies. ACM , c 2009 : 1 - 12 .

AHLGREN B , et al . A survey of information-centric networking [J ] . Communications Magazine , 2012 , 50 ( 7 ): 26 - 36 .

WANG Y G , et al . Advertising cached contents in the control plane:necessity and feasibility [C ] // Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on . c 2012 : 286 - 291 .

SANG S , BI J , WU J P . Collaborative caching based on hash-routing for information-centric networking [J ] . ACM Sigcomm Computer Communication Review , 2013 , 34 ( 4 ): 535 - 536 .

SAIL . NetInf Content Delivery and Operations [R ] . SAIL Project, SAIL Project Deliverable D-3.2 , 2011 .

SOURLAS V , FLEGKAS P , PASCHOS G S , et al . Storage planning and replica assignment in content-centric publish/subscribe net-works [J ] . Computer Networks , 2011 , 55 ( 18 ): 4021 - 4032 .

REN J , QI W , et al . MAGIC: a distributed max-gain in-network cach-ing strategy in information-centric networks [C ] // Computer Communi-cations Workshops (INFOCOM WKSHPS), 2014 IEEE Conference on . c 2014 : 470 - 475 .

ARIANFAR S , NIKANDER P , OTT J . On content-centric router design and implications [C ] // Proc of ReARCH Workshop . New York, NY, USA , c 2010 : 1 - 6 .

PSARAS I , CHAI W K , PAVLOU G . Probabilistic in-network caching for information-centric networks [C ] // Proc of ICN Workshop on In-formation Centric Networking . New York, NY, USA , c 2012 : 55 - 60 .

MING Z X , XU M W , WANG D . Age-based cooperative caching in information-centric networks [C ] // Computer Communications Work-shops (INFOCOM WKSHPS), 2012 IEEE Conference on . New York, NY, USA , c 2012 : 268 - 273 .

CHAI W K , HE D , PSARAS I , et al . Cache less for more in informa-tion-centric networks [C ] // Networking 2012, Ser Lecture Notes in Computer Science . c 2012 : 27 - 40 .

EUM S , et al . CATT: potential based routing with content caching for ICN [C ] // The Second Edition of the ICN Workshop on Informa-tion-centric Networking . c 2012 .

WANG Y , LEE K , VENKATARAMAN B , et al . Advertising cached contents in the control plane: Necessity and feasibili y [C ] // Proc. of IEEE INFOCOM WKSHPS . c 2012 : 286 - 291 .

HOQUE A K M , AMIN S O , ALYYAN A , et al . Nlsr: named-data link state routing protocol [C ] // The 3rd ACM SIGCOMM Workshop on In-formation-centric Networking. ACM , c 2013 : 15 - 20 .

WANG L , HOQUE A K M , YI C , et al . OSPFN: An OSPF Based Routing Protocol for Named Data Networking [R ] . University of Memphis and University of Arizona , 2012 .

ALEXANDER A , MOISEENKO I , ZHANG L X . ndnSIM: NDN simulator for NS-3 Named Data Networking (NDN) Project [R ] . 2012 .

HENDERSON T R , et al . ns-3 project goals [C ] // The 2006 Workshop on ns-2: the IP Network Simulator. ACM , c 2006 .

SCIE project [EB/OL ] . http://scie.ac.cn/view/scie.jsp http://scie.ac.cn/view/scie.jsp .

浏览量

863

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于节点中心性度量的内容中心网络缓存机制

内容中心网络状态感知路由设计