[1]李伟,潘沛生.协作缓存及数学建模在CCN 中的应用[J].计算机技术与发展,2018,28(07):38-42.[doi:10.3969/ j. issn.1673-629X.2018.07.009]
　LI Wei,PAN Pei-sheng.Application of Cooperative Caching and Mathematical Modeling in CCN[J].,2018,28(07):38-42.[doi:10.3969/ j. issn.1673-629X.2018.07.009]
点击复制

协作缓存及数学建模在CCN 中的应用()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
28
期数:
2018年07期
页码:
38-42
栏目:
智能、算法、系统工程
出版日期:
2018-07-10

文章信息/Info

Title:
Application of Cooperative Caching and Mathematical Modeling in CCN
文章编号:
1673-629X(2018)07-0038-05
作者:
李伟; 潘沛生
南京邮电大学 通信与信息工程学院,江苏 南京 210003
Author(s):
LI Wei; PAN Pei-sheng
School of Communication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
关键词:
内容中心网络; 自治系统; 协作缓存; 控制节点; 任意拓扑; 数学建模
Keywords:
CCN; autonomous system; collaborative cache; control nodes; random topology; mathematical modeling
分类号:
TP31
DOI:
10.3969/ j. issn.1673-629X.2018.07.009
文献标志码:
A
摘要:
为了解决当前网络暴露出来的诸多问题,对未来网络架构的研究已经形成一个新的领域。 而内容中心网络则是这个领域中非常重要的研究对象。在内容中心网络中,每个节点都具备缓存数据的能力,因此缓存策略对内容中心网络的性能具有决定性的影响。通过对现有缓存策略的调研发现,网络中的各节点之间缺少协作机制,相邻节点不存在通信,也就不能较为智能地选择已存储请求内容的最近节点。基于这种现状,对基于内容流行度的自治系统协作缓存在网络中的应用进行了研究,将网络划分为多个自治系统,确定各自的控制节点,协调所属系统中各节点之间的通信,以求得到更好的网络性能。对任意的网络拓扑结构进行数学建模,求解并比较现有策略和基于自治系统的协作缓存策略的三种指标,包括平均跳数、命中率和时延。仿真结果表明,该自治系统协作缓存策略的应用使得网络性能更佳。
Abstract:
In order to solve the problems exposed by the current network,the study of architecture in the future network has formed a new area for research. The content-center network (CCN) is becoming a research hot spot in this area. Each node in CCN has the ability to cache data,so the caching strategy has a decisive impact to the performance of network. The survey shows that the nodes in CCN lack cooperation mechanism in the existing caching strategies,and it is impossible to choose the nearest node storing required contents intelligently. With the analysis of these problems,we propose an autonomous system collaboration caching strategy based on the content popularity (P-ASS). The network is divided into multiple autonomous systems in P-
ASS,and the leading node is determined to coordinate communications among nodes to get better performance. In order to make the conclusion more universal,the simulation is performed on anytopology. Average hops,hit ratio and delay time are calculated and compared between some existing strategies and P-ASS. The result of simulation shows that P-ASS will improve the cache efficiency.

相似文献/References:

[1]赵会洋 王爽 魏士伟.网格安全模型中认证策略的研究[J].计算机技术与发展,2010,(04):171.
　ZHAO Hui-yang,WANG Shuang,WEI Shi-wei.Research on Authentication Policy of Grid Security Model[J].,2010,(07):171.
[2]刘欣,刘华富. 互联网前缀劫持攻击研究[J].计算机技术与发展,2015,25(02):131.
　LIU Xin,LIU Hua-fu. Research on Prefix Hijacking in Internet[J].,2015,25(07):131.
[3]黄莹莹,杨龙祥.基于内容中心网的缓存算法研究[J].计算机技术与发展,2018,28(05):187.[doi:10.3969/ j. issn.1673-629X.2018.05.042]
　HUANG Ying-ying,YANG Long-xiang.Survey of Caching Strategies in Content Centric Networks[J].,2018,28(07):187.[doi:10.3969/ j. issn.1673-629X.2018.05.042]
[4]郑凯月,潘沛生.基于内容流行度和节点重要度的 CCN 缓存策略[J].计算机技术与发展,2018,28(06):73.[doi:10.3969/ j. issn.1673-629X.2018.06.016]
　ZHENG Kai-yue,PAN Pei-sheng.A Caching Scheme Based on Content Popularity and Betweenness in Content Centric Network[J].,2018,28(07):73.[doi:10.3969/ j. issn.1673-629X.2018.06.016]
[5]段炼,杨龙祥,任美翠. 内容中心网络及其缓存策略研究[J].计算机技术与发展,2017,27(03):75.
　DUAN Lian,YANG Long-xiang,REN Mei-cui. Research on Content Centric Networking and Its Caching Strategies[J].,2017,27(07):75.
[6]王旭辉,张建伟,蔡增玉,等.内容中心网络缓存策略研究[J].计算机技术与发展,2018,28(11):56.[doi:10.3969/ j. issn.1673-629X.2018.11.013]
　WANG Xu-hui,ZHANG Jian-wei,CAI Zeng-yu,et al.Research on Caching Strategy for Content Centric Network[J].,2018,28(07):56.[doi:10.3969/ j. issn.1673-629X.2018.11.013]
[7]杨佳鑫,潘沛生.CCN中用于可伸缩视频流的缓存替换策略[J].计算机技术与发展,2019,29(04):160.[doi:10. 3969 / j. issn. 1673-629X. 2019. 04. 032]
　YANG Jia-xin,PAN Pei-sheng.A Cache Replacement Strategy for Scalable Video Streaming in CCN[J].,2019,29(07):160.[doi:10. 3969 / j. issn. 1673-629X. 2019. 04. 032]

更新日期/Last Update: 2018-08-27