Caching Algorithm with a Novel Cost Model to Deliver Content and Its Interest over Content Centric Networks

作     者：SU Zhou FANG Dongfeng HAN Bo 

作者机构：School of Mechatronic Engineering and AutomationShanghai University Institute of Electronic and InformationXi'an Jiaotong University 

基　　金：supported in part by the fundamental key research project of Shanghai Municipal Science and Technology Commission under grant 12JC1404201 the Ministry of Education Research Fund-China Mobile(2012) MCM20121032 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2015年第12卷第7期

页      码：23-30页

摘      要：Recently the content centric networks(CCNs) have been advocated as a new solution to design future networks. In the CCNs, content and its interest are delivered over the content store and pending interest table, respectively, where both have limited capacities. Therefore, how to design the corresponding algorithms to efficiently deliver content and inertest over them becomes an important issue. In this paper, based on the analysis of content distribution, status of content store, and pending interest, we propose a novel caching algorithm with which the resources of content store and pending interest table can be efficiently used. Simulation results prove that the proposal can outperform the conventional methods.

主 题 词：网络缓存 算法 成本模型 传统方法 仿真结果 设计 存储 

学科分类：0810[工学-土木类] 12[管理学] 1201[管理学-管理科学与工程类] 0808[工学-自动化类] 0809[工学-计算机类] 0839[0839] 08[工学] 081201[081201] 0812[工学-测绘类] 

核心收录：

D　O　I：10.1109/CC.2015.7188522

馆 藏 号：203804392...