基于概率的启发式ICN缓存内容放置方法

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

通信学报 ›› 2016, Vol. 37 ›› Issue (5): 62-72.doi: 10.11959/j.issn.1000-436x.2016093

基于概率的启发式ICN缓存内容放置方法

吴海博¹,李俊¹(),智江^1,²

¹ 中国科学院计算机网络信息中心，北京100190
² 中国科学院研究生院，北京100049

出版日期:2016-05-25 发布日期:2016-06-01
基金资助:
CNIC“一三五”所级专项基金资助项目;国家重点基础研究发展计划（“973”计划）基金资助项目;中国科学院知识创新工程青年人才领域基金资助项目;中国科学院重大装备研制基金资助项目

Probability-based heuristic content placement method for ICN caching

Hai-bo WU¹,Jun LI¹(),Jiang ZHI^1,²

¹ Computer Network Information Center,Chinese Academy of Sciences,Beijing 100190,China
² Graduate School,Chinese Academy of Sciences,Beijing 100049,China

Online:2016-05-25 Published:2016-06-01
Supported by:
Around Five Top Priorities of“One-Three-Five”Strategic Planning,CNIC;The National Basic Research Program of China(973 Program);The Knowledge Innovation Program of the Chinese Acade-my of Sciences;The Significant Equipment Development Program of Chinese Academy of Sciences

摘要/Abstract

摘要：

提出一种基于概率存储的启发式住处中心网络内容缓存方法（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.

Key words: information-centric networking, in-network caching, content placement, cooperative caching

吴海博,李俊,智江. 基于概率的启发式ICN缓存内容放置方法[J]. 通信学报, 2016, 37(5): 62-72.

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.

图/表 9

表1

图1

图2

表2

图3

图4

图5

图6

表3

参考文献 22

[1]	Cisco visual networking index:forecast and methodology,2012～2017[[EB/OL]. .
[2]	JACOBSON V , SMETTERS D K , THORNTON J D , et al. Network-ing named content[C]// The ACM CoNEXT.ACM, c2009: 1-12.
[3]	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.
[4]	DANNEWITZ C , GOLIC J , OHLMAN B , et al. Secure naming for a network of information[C]// The IEEE INFOCOM Workshops.IEEE, c2010: 1-6.
[5]	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.
[6]	LAOUTARIS N , CHE H , STAVRAKAKIS I . The LCD interconnec-tion of LRU caches and its analysis[J]. Performance Evaluation, 2006,63(7): 609-634.
[7]	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.
[8]	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.
[9]	霍如, 刘江, 黄韬 , 等. 基于相关性概率的信息中心网络协作缓存策略[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.
[10]	ROSENSWEIG E J , KUROSE J . Breadcrumbs:efficient,best-effort content location in cache networks[C]// The IEEE INFOCOM.IEEE. c2009: 2631-2635.
[11]	ZHU Y , CHEN M , NAKAO A . Conic:content-oriented network with indexed caching[C]// The IEEE INFOCOM 2010 Workshops.IEEE, c2010: 1-6.
[12]	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.
[13]	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.
[14]	WANG S , BI J , WU J , et al. Could in-network caching benefit infor-mation-centric networking[C]// AINTEC, c2011: 112-115.
[15]	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.
[16]	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.
[17]	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.
[18]	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.
[19]	AFANASYEV A , MOISEENKO I , ZHANG L . ndnSIM:NDN simu-lator for NS-3,NDN[R]. Technical Report NDN-0005, 2012.
[20]	LAOUTARIS N , SYNTILA S , STAVRAKAKIS I . Meta algorithms for hierarchical Web caches[C]// IPCCC. c2004: 445-452.
[21]	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.
[22]	LEE B , PEI C , LI F , et al. Web caching and Zipf-like distributions:evidence and implications[C]// The IEEE INFOCOM, c1999: 126-134.

符号	说明
?_i	节点v_i收到的关于内容块c的平均请求速率
p_c	内容块c的热度（被请求的概率）
b_c,i,r	将内容块c缓存于节点v_i时对于请求者v_r而言获得的收益
e_c,i	二元变量，表示是否在节点v_i处缓存内容块c
V	所有缓存节点的集合
C	所有内容块的总容量（以内容块为单位）
C(i)	缓存节点v_i的最大容量（以内容块为单位）

参数	默认值	变化范围
树层数	5	2～6
内容数量	10 000	4 000～40 000
缓存容量	40	25～55
请求速率	200 req/s	100～400
访问模式	Zipf:a=1.0	0.7～1.2

计算次数	总耗时/ms	平均耗时/μs
1 000 000	7 410	7.410
4 000 000	31 720	7.930
7 000 000	56 470	8.067
10 000 000	82 750	8.275

基于概率的启发式ICN缓存内容放置方法

Probability-based heuristic content placement method for ICN caching

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献 22

相关文章 10

Metrics

推荐阅读 0

[1]	王劲林, 井丽南, 陈晓, 尤佳莉. 面向多模态网络的可编程数据处理方法及系统设计[J]. 通信学报, 2022, 43(4): 14-25.
[2]	蔡艳, 吴凡, 朱洪波. D2D协作边缘缓存系统中基于传输时延的缓存策略[J]. 通信学报, 2021, 42(3): 183-189.
[3]	王蕊, 申敏, 何云, 刘香燕. Cell-Free大规模MIMO系统中基于传输时延的缓存策略研究[J]. 通信学报, 2021, 42(12): 134-143.
[4]	蒋雁翔,夏骋宇. 雾无线接入网中的多层协作缓存方法[J]. 通信学报, 2019, 40(9): 116-123.
[5]	吴大鹏,李雪,李红霞. 基于TWDM-PON与C-RAN的QoE感知视频协作缓存与传输机制[J]. 通信学报, 2019, 40(3): 80-91.
[6]	智江,李俊,吴海博,任勇毛. 基于边缘优先的ICN缓存协作策略[J]. 通信学报, 2017, 38(3): 53-64.
[7]	陈龙,汤红波,罗兴国,柏溢,张震. 基于收益感知的信息中心网络缓存机制[J]. 通信学报, 2016, 37(5): 130-142.
[8]	蔡君,余顺争,刘外喜. 基于节点社团重要度的ICN缓存策略[J]. 通信学报, 2015, 36(6): 173-182.
[9]	黄韬，刘江，霍如，魏亮，刘韵洁. 未来网络体系架构研究综述[J]. 通信学报, 2014, 35(8): 23-197.
[10]	黄韬,刘江,霍如,魏亮,刘韵洁. 未来网络体系架构研究综述[J]. 通信学报, 2014, 35(8): 184-197.