Probability-based heuristic content placement method for ICN caching

Hai-bo WU; Jun LI; Jiang ZHI

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

您当前的位置：

首页 >

文章列表页 >

Probability-based heuristic content placement method for ICN caching

Papers | 更新时间：2024-06-05

- Probability-based heuristic content placement method for ICN caching
- Journal on Communications Vol. 37, Issue 5, Pages: 62-72(2016)
- 作者机构：
  
  1. 中国科学院计算机网络信息中心，北京100190
  2. 中国科学院研究生院，北京100049
- 作者简介：
- 基金信息：
  
  Five Top Priorities of“One-Three-Five”Strategic Planning, CNIC(CNIC_PY-1401);The National Basic Research Program of China (973 Program)(2012CB315803);Knowledge Innovation Program, CAS(CNIC_QN_1508);The Significant Equipment Development Program of Chinese Academy of Sciences
- DOI：10.11959/j.issn.1000-436x.2016093
  CLC： TP393
- Online First：2016-05，
  
  Published：15 May 2016
- 稿件说明：
移动端阅览
Hai-bo WU, Jun LI, Jiang ZHI. Probability-based heuristic content placement method for ICN caching[J]. Journal on Communications, 2016, 37(5): 62-72.
DOI：

Hai-bo WU, Jun LI, Jiang ZHI. Probability-based heuristic content placement method for ICN caching[J]. Journal on Communications, 2016, 37(5): 62-72. DOI： 10.11959/j.issn.1000-436x.2016093.

摘要

提出一种基于概率存储的启发式住处中心网络内容缓存方法（PCP）。主要思想是请求消息和数据消息在传输过程中统计必要信息，当数据消息返回时，沿途各缓存节点按照一定概率决策是否在本地缓存该内容。设计缓存概率时综合考虑内容热度和缓存放置收益，即内容热度越高，放置收益越大的内容被缓存的概率越高。实验结果表明，PCP在缓存服务率、缓存命中率、平均访问延迟率等方面，与现有方法相比具有显著优势，同时PCP开销较小。

Abstract

A probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back

on-path cache nodes decide whether to cache the content with certain probability.The probability is associated with the content popu-larity and placement benefit

i.e.

proportional to content popularity and content placement benefit.The experimental re-sults indicate PCP can achieve salient performance gain in terms of cache service ratio

cache hit ratio

access latency ra-tio

compared with current strategies.Meanwhile

PCP's overhead is affordable.

关键词

Keywords

references

Cisco visual networking index:forecast and methodology,2012～2017[ [EB/OL ] . http://www.cisco.com/en/US/solutions/collateral/ns341/ns525/ns537/ns705/ns827/white_paper_c11-481360_ns827_Networking_Solutions_White_Paper.html http://www.cisco.com/en/US/solutions/collateral/ns341/ns525/ns537/ns705/ns827/white_paper_c11-481360_ns827_Networking_Solutions_White_Paper.html .

JACOBSON V , SMETTERS D K , THORNTON J D , et al . Network-ing named content [C ] // The ACM CoNEXT.ACM , c2009 : 1 - 12 .

TEEMU K , MOHIT C , CHUN B G , et al . A data-oriented(and beyond)network architecture [J ] . ACM SIGCOMM Computer Communication Review , 2007 , 37 ( 4 ): 181 - 192 .

DANNEWITZ C , GOLIC J , OHLMAN B , et al . Secure naming for a network of information [C ] // The IEEE INFOCOM Workshops.IEEE , c2010 : 1 - 6 .

NIKOS F , PEKKA N , DIRK T , et al . Developing information net-working further:from PSIRP to PURSUIT [J ] . Broadband Communi-cations,Networks,and Systems , 2010 , 66 ( 3 ): 1 - 13 .

LAOUTARIS N , CHE H , STAVRAKAKIS I . The LCD interconnec-tion of LRU caches and its analysis [J ] . Performance Evaluation , 2006 , 63 ( 7 ): 609 - 634 .

PSARAS I , CHAI W K , PAVLOU G . Probabilistic in-network caching for information-centric networks [C ] // The Second Edition of the ICN Work-shop on Information-Centric Networking.ACM , c2012 : 55 - 60 .

CHO K , LEE M , PARK K , et al . WAVE:popularity-based and collabor-ative in-network caching for content-oriented networks [C ] // The IEEE INFOCOM Workshop on NOMEN.IEEE , c2012 : 316 - 321 .

霍如 , 刘江 , 黄韬 , 等 . 基于相关性概率的信息中心网络协作缓存策略 [J ] ．北京邮电大学学报 , 2015 , 38 ( 1 ): 16 - 20 .

HUO R , LIU J , HUANG T , et al . Cooperative caching strategy based on correlation probability in information centric networking [J ] . Jour-nal of Beijing University of Posts and Telecommunications , 2015 , 38 ( 1 ): 16 - 20 .

ROSENSWEIG E J , KUROSE J . Breadcrumbs:efficient,best-effort content location in cache networks [C ] // The IEEE INFOCOM.IEEE . c2009 : 2631 - 2635 .

ZHU Y , CHEN M , NAKAO A . Conic:content-oriented network with indexed caching [C ] // The IEEE INFOCOM 2010 Workshops.IEEE , c2010 : 1 - 6 .

LI Z , SIMON G . Time-shifted TV in content centric networks:the case for cooperative in-network caching [J ] // The 2011 IEEE ICC.IEEE , c2011 : 1 - 6 .

MING Z , XU M , WANG D . Age-based cooperative caching in infor-mation-centric networks [C ] // IEEE INFOCOM 2012 on Computer Communications Workshops.IEEE , c2012 : 268 - 273 .

WANG S , BI J , WU J , et al . Could in-network caching benefit infor-mation-centric networking [C ] // AINTEC , c2011 : 112 - 115 .

LIU W X , YU S Z , CAI J , et al . Scheme for cooperative caching in ICN [J ] . Journal of Software , 2013 , 24 ( 8 ): 1947 - 1962 .

WANG L , HOQUE A , YI C , et al . OSPFN:an OSPF based routing protocol for named data networking [R ] . University of Memphis and University of Arizona,Tech Rep , 2012 .

MAHMUDUL A K M , SYED O A , ADAM A , et al . NLSR:named-data link state routing protocol [C ] // The ACM SIGCOMM Workshop , c2013 : 15 - 20 .

HU X Y , GONG J , CHENG G , et al . Enhancing in-network caching by coupling cache placement,replacement and location [C ] // ICC . c2015 : 7301 - 7307 .

AFANASYEV A , MOISEENKO I , ZHANG L . ndnSIM:NDN simu-lator for NS-3,NDN [R ] . Technical Report NDN-0005 , 2012 .

LAOUTARIS N , SYNTILA S , STAVRAKAKIS I . Meta algorithms for hierarchical Web caches [C ] // IPCCC . c2004 : 445 - 452 .

CHAI W K , HE D , PSARAS I , et al . Cache Less for more in informa-tion-centric networks [C ] // The NETWORKING 2012.Springer Berlin Heidelberg , c2004 : 27 - 40 .

LEE B , PEI C , LI F , et al . Web caching and Zipf-like distributions:evidence and implications [C ] // The IEEE INFOCOM , c1999 : 126 - 134 .

Views

1770

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Edge-first-based cooperative caching strategy in information centric networking

D2D cooperative caching strategy based on graph collaborative filtering model

Programmable data processing method and system design for polymorphic network

Research on caching strategy based on transmission delay in Cell-Free massive MIMO systems

Multi-tier cooperative caching in fog radio access network

Related Author

Yong-mao REN

Jiang ZHI

Jun LI

Linming LIAN

Pingjie OU

Xuemei YUAN

Ningjiang CHEN

Jinlin WANG

Related Institution

University of Chinese Academy of Sciences

School of Computer and Electronic Information, Guangxi University

Key Laboratory of Parallel, Distributed and Intelligent Computing(Guangxi University), Education Department of Guangxi Zhuang Autonomous Region

Guangxi Intelligent Digital Services Research Center of Engineering Technology

School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences

AI问答

⁰