一种用于内容中心网络的缓存随机放置策略

doi:10.3969/j.issn.1001-2400.2014.06.022

J4 ›› 2014, Vol. 41 ›› Issue (6): 131-136+187.doi: 10.3969/j.issn.1001-2400.2014.06.022

一种用于内容中心网络的缓存随机放置策略

胡骞;武穆清;郭嵩;彭蠡

(北京邮电大学网络体系构建与融合北京市重点实验室，北京 100876)

收稿日期:2014-01-02 出版日期:2014-12-20 发布日期:2015-01-19
通讯作者: 胡骞
作者简介:胡骞(1988-)，男，北京邮电大学博士研究生，E-mail：huqian@bupt.edu.cn．
基金资助:
网络体系构建与融合北京市重点实验室主任基金资助项目(2013BKL-NSAC-ZJ-06)

Random cache placement strategy for content-centric networking

HU Qian;WU Muqing;GUO Song;PENG Li

(Laboratory of Network System Architecture and Convergence, BUPT, Beijing 100876, China)

Received:2014-01-02 Online:2014-12-20 Published:2015-01-19
Contact: HU Qian

摘要/Abstract

摘要：

以内容为中心的网络是一种新型网络架构，它打破了传统的“主机—主机”通信模式，将内容本身作为网络的核心．以内容为中心的网络通过分布式的缓存机制对内容业务提供有效支持，缓存的放置策略也成为研究的热点．首先提出一种分布式的缓存随机放置策略，基于节点与内容源之间的跳数随机选择缓存放置节点，实现节点缓存的负载均衡；然后在该策略下推导缓存命中率与内容热度分布、请求到达率、缓存大小的关系．数值计算及仿真结果表明，该策略可以提高缓存命中率，与以内容为中心的网络传统策略相比，获取内容所需的平均跳数可减少5.59％～6.86％．

关键词: 内容中心网络, 缓存, 缓存放置策略, 缓存命中率, 分布式算法

Abstract:

Content-Centric networking (CCN) is a new network architecture, which has broken the traditional end-to-end communication mode and focuses on contents. In CCN, in-network caching can enhance content delivery on a global scale without requiring a special infrastructure. In this paper we propose a distributed random cache placement strategy, in which caching nodes are selected based on the distance to the content provider. Then the expression for the cache hit ratio is derived as functions of the content request rate, content popularity distribution and cache size in each node. Numerical analysis and simulations show that our strategy can improve the cache hit ratio and reduce average hops to get contents by 5.59％～6.86％.

Key words: content-centric networking, cache memory, cache placement, cache miss ratio, distributed algorithms

中图分类号:

TP393

胡骞;武穆清;郭嵩;彭蠡. 一种用于内容中心网络的缓存随机放置策略[J]. J4, 2014, 41(6): 131-136+187.

HU Qian;WU Muqing;GUO Song;PENG Li. Random cache placement strategy for content-centric networking[J]. J4, 2014, 41(6): 131-136+187.

参考文献

［1］ Jacobson V, Smetters D K, Thornton J D, et al. Networking Named Content ［C］//Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. New York: ACM, 2009: 1-12.
［2］ Ahlgren B, Dannewitz C, Imbrenda C, et al. A Survey of Information-centric Networking ［J］. IEEE Communications Magazine, 2012, 50(7): 26-36.
［3］ Podlipnig S, Bszrmenyi L. A Survey of Web Cache Replacement Strategies ［J］. ACM Computing Surveys, 2003, 35(4): 374-398.
［4］唐丽均, 李云, 柴毅, 等. 一种结合传染路由的缓存调度算法［J］. 西安电子科技大学学报, 2012, 39(1): 141-145.
Tang Lijun, Li Yun, Chai Yi, et al. Buffer Schedule Algorithm Combined with Epidemic Routing ［J］. Journal of Xidian University, 2012, 39(1): 141-145.
［5］ Chai W K, He D, Psaras I, et al. Cache “Less for More” in Information-centric Networks (Extended Version) ［J］. Computer Communications, 2013, 36(7): 758-770.
［6］ Cho K, Lee M, Park K, et al. WAVE: Popularity-based and Collaborative In-network Caching for Content-oriented Networks ［C］//Conference on Computer Communications Workshops. Piscataway: IEEE, 2012: 316-321.
［7］ Psaras I, Chai W K, Pavlou G. Probabilistic In-network Caching for Information-centric Networks ［C］//Proceedings of the Second Edition of the ICN Workshop on Information-centric Networking. New York: ACM, 2012: 55-60.
［8］ Zhang G, Li Y, Lin T. Caching in Information Centric Networking: a Survey ［J］. Computer Networks, 2013, 57(16): 3128-3141.
［9］ Li J, Liu B, Wu H. Energy-efficient In-network Caching for Content-centric Networking ［J］. IEEE Communications Letters, 2013, 17(4): 797-800.
［10］ Carofiglio G, Gallo M, Muscariello L. On the Performance of Bandwidth and Storage Sharing in Information-centric Networks ［J］. Computer Networks, 2013, 57(17): 3743-3758.
［11］ Wang J M, Zhang J, Bensaou B. Intra-AS Cooperative Caching for Content-centric Networks ［C］//Proceedings of the 3rd ACM SIGCOMM Workshop on Information-centric Networking. New York: ACM, 2013: 61-66.
［12］ Adamic L A, Huberman B A. Zipf's Law and the Internet ［J］. Glottometrics, 2002, 3(1): 143-150.

[1]	谭雯,甘新标,白皓,肖调杰,陈旭光,雷书梦,刘杰. 面向超级计算机系统的大规模图遍历优化[J]. 西安电子科技大学学报, 2021, 48(6): 84-95.
[2]	王建伟;张海林. 上行小小区网络采用累计分布函数的资源分配[J]. 西安电子科技大学学报, 2018, 45(3): 163-168.
[3]	周彦果;张海林;陈瑞瑞. 毫微微小区网络中采用双层博弈的资源分配[J]. 西安电子科技大学学报, 2017, 44(4): 62-68.
[4]	芦存博;肖嵩;权磊;薛晓. 一种编码感知路由低时延数据传输算法[J]. 西安电子科技大学学报, 2016, 43(4): 17-22+146.
[5]	肖宜龙;蒋海波. 无人值守传感器网络的高性能分布式存储算法[J]. J4, 2014, 41(4): 173-178+185.
[6]	唐丽均;李云;柴毅;王祥. 一种结合传染路由的缓存调度算法[J]. J4, 2012, 39(1): 141-145.
[7]	杨帆;邱智亮;刘增基;严敬. 高速交换网络中基于综合优先级计算的调度及路由算法 [J]. J4, 2007, 34(5): 702-707.

一种用于内容中心网络的缓存随机放置策略

Random cache placement strategy for content-centric networking

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 7

Metrics

本文评价

推荐阅读 0