内容分发网络中基于相关内容吸引的缓存算法

doi:10.3969/j.issn.1000-3428.2014.09.024

计算机工程

内容分发网络中基于相关内容吸引的缓存算法

张　成^a,b ,杨东风^a,黄　协^b ,张根耀^a

(延安大学a. 数学与计算机科学学院;b. 网络信息中心,陕西延安716000)

收稿日期:2013-10-28 出版日期:2014-09-15 发布日期:2014-09-12
作者简介:张　成(1971 - ),男,副教授、博士,主研方向:内容分发网络,社交网络,网络安全,服务计算;杨东风,副教授;黄　协,工程师;张根耀,教授。
基金资助:
国家自然科学基金资助项目(61379026);陕西省工业攻关计划基金资助项目(2013K06-39)。

Cache Algorithm Based on Related Content Attracting in Content Delivery Network

ZHANG Cheng^a,b ,YANG Dong-feng^a ,HUANG Xie ^b ,ZHANG Gen-yao ^a

(a. College of Mathematics & Computer Science;b. Network & Information Center,Yan’an University,Yan’an 716000,China)

Received:2013-10-28 Online:2014-09-15 Published:2014-09-12

摘要/Abstract

摘要： 内容分发网络中基于内容名的缓存算法会导致路由表规模随网络增长而膨胀,将严重影响网络路由效率和性能。针对该问题,提出一种基于相关内容吸引的节点缓存算法。利用本地缓存算法,通过节点已缓存内容对其他内容的吸引作用吸引主要特征内容,排斥具有次要特征内容,将缓存中不同特征内容的数量差异进行放大,使缓存内容表现出明显稳定的内容特征。同时设计相关内容生存时间相互增强的缓存策略,以减少路由通告信息量,提高内容分发网络的路由能力。实验结果表明,该算法在有效解决路由问题的同时,能增强缓存内容稳定性,提高路由可信度。

关键词: 内容分发网络, 缓存算法, 内容吸引, 缓存因子, 缓存冗余, 路由

Abstract: The existing content cache algorithm of Content Delivery Network(CDN) leads to the expansion of routing table with the network increasing,which will impair the routing efficiency and network performance. Therefore,based on related contents attracting,a related contents attracting algorithm is proposed. With the effect of attracting similar contents cached in other near nodes,for the purpose of apparently stable featured contents of nodes cached,the algorithm attracts major characteristic contents,rejects secondary feature contents,and enlarges the difference of different characteristic content. It also gathers the related contents on the same nodes via the mutual attraction with same contents feature,which facilitates the cache contents feature abstraction. Meanwhile,the strategy of lifetime increasement between contents with main feature is designed to deduce the routing advertisement and improve the routing scalability. Experimental results show that the proposed algorithm can reduce the update frequency of cache content,and improve the routing reliability.

Key words: Content Delivery Network(CDN);cache algorithm;contents attracting;cache factor;cache redundancy, routing

中图分类号:

TN911. 22

张成,杨东风,黄协,张根耀. 内容分发网络中基于相关内容吸引的缓存算法[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2014.09.024.

ZHANG Cheng,YANG Dong-feng,HUANG Xie,ZHANG Gen-yao. Cache Algorithm Based on Related Content Attracting in Content Delivery Network[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2014.09.024.

http://www.ecice06.com/CN/Y2014/V40/I9/117

参考文献

参考文献 [ 1 ]　Mellado A, Garcia M A, Zahariadis F, et al. Architectures for Future Media Internet [ C ] / / Proceedings of the 2nd International Conference on User Centric Media. Palma de Mallorca,Spain:[s. n. ],2012: 105-112. [ 2 ]　Pallis G,Vakali A. Insight andPerspectives for Content Delivery Networks [J]. Communications of the ACM, 2006,49(1):101-106. [ 3 ]　Hei Xiaojun,Liang Chao,Liang Jian,et al. A Measurement Study of a Large-scale P2P IPTV System [ J ]. IEEE Transactions on Multimedia,2007,9(8):1672-1687. [ 4 ]　尹　浩,詹同宇,林　闯. 多媒体网络:从内容分发网络到未来互联网[J]. 计算机学报,2012,35 (6): 1120-1130. [ 5 ]　Feldmann A. Internet Clean-slate Design: What and Why? [ J ]. ACM SIGCOMM Computer Communication Review,2007,37(3):59-64. [ 6 ]　Ahlgren B,Dannewitz C,Imbrenda C,et al. A Survey of Infor-mation-centric Networking[J]. IEEE Communications Magazine,2012,50(7):26-36. [ 7 ]　Choi J,Han J,Cho E,et al. A Survey on Contentoriented Networking for Efficient Content Delivery [ J ]. IEEE Communications Magazine,2011,49(3):121-127. [ 8 ]　Wang Y, Lee K, Venkataraman B, et al. Advertising Cached Contents in the Control Plane: Necessity and Feasibility[C] / / Proceedings of INFOCOM WKSHPS. [S. l. ]:IEEE Press,2012:286-291. [ 9 ]　Koponen T,Chawla M,Chun B G,et al. A Dataoriented (and Beyond) Network Architecture[J]. Proceedings of ACM SIGCOMM Computer Communication Review, 2007,37(4):181-192. [10]　Choi J,Han J,Cho E. et al. A Survey on Contentoriented Networking for Efficient Content Delivery [ J ]. IEEE Communications Magazine,2011,49(3):121-127. [11]　Rajahalme J,S?rel? M,Visala K,et al. On Name-based Inter-domain Routing[J]. Computer Networks,2011,55 (4):975-986. [12]　Jacobson V, Smetters D K, Thornton J D, et al. Networking Named Content[J]. Communications of the ACM,2012,55(1):117-124. [13]　Boguna M,Krioukov D, Claffy K C. Navigability of Complex Networks [J]. Nature Physics,2008,5 (1): 74-80. [14]　Yuan H, Crowley P. Performance Measurement of Name-centric Content Distribution Methods [ C ] / / Proceeding of ANCS’ 11. [S. l. ]:IEEE Press,2011: 223-224. [15]　Boguná M,Papadopoulos F,Krioukov D. Sustaining the Internet with Hyperbolic Mapping [J]. Nature Communications, 2010,(1). [16]　Fricker C,Robert P,Roberts J,et al. Impact of Traffic Mix on Caching Performance in a Content-centric Network [ C ] / / Proceedings of INFOCOM WKSHPS 2012. [S. l. ]:IEEE Press,2012:310-315. [17]　Lee U, Rimac I, Hilt V. Greening the Internet with Content-centric Networking[C] / / Proceedings of the 1st International Conference on Energy-efficient Computing and Networking. [S. l. ]:ACM Press,2010:179-182. [18]　Zhang Lixia, Estrin D, Burke J, et al. Named Data Networking(NDN) Project[Z]. 2010. [19]　张　威. 毕　军. 吴建平. 互联网域间路由可扩展性 [J]. 软件学报,2011,22(1):84-100. [20]　Arianfar S,Nikander P,Ott J. On Content-centric Router Design and Implications [C] / / Proceedings of the Rearchitecting the Internet Workshop. [S. l. ]:ACM Press, 2010:5. [21]　Dhamdhere A,Dovrolis C. Ten Years in the Evolution of the Internet Ecosystem [ C ] / / Proceedings of the 8th ACM SIGCOMM Conference on Internet measurement. [S. l. ]:ACM Press,2008:183-196. [22]　Hwang H, Ata S, Murata M. The Impact of FQDN Database Updates on Name-based Routing Architecture [C] / / Proceedings of NOMS WKSPS. [ S. l. ]:IEEE Press,2010:16-21. 编辑　金胡考

[1]	杨敏, 张玲华. WSN中基于区域感知的改进AODV路由协议[J]. 计算机工程, 2023, 49(8): 130-136.
[2]	赵徐炎, 崔允贺, 钱清, 郭春, 申国伟. 基于虚拟扩展网络的虚拟机及路由路径联合部署[J]. 计算机工程, 2023, 49(8): 154-162.
[3]	毕翔, 黄晃, 张本宏, 卫星. 基于分簇与改进Q学习的车联网V2V复合路由算法[J]. 计算机工程, 2023, 49(3): 221-230,247.
[4]	席荣康, 蔡满春, 芦天亮. 基于数据增强与流数据处理的Tor流量分析模型[J]. 计算机工程, 2023, 49(3): 177-184.
[5]	赵蓓英, 姬伟峰, 翁江, 吴玄, 李映岐. 基于启发式Q学习的FANET可信路由算法[J]. 计算机工程, 2022, 48(5): 162-169.
[6]	陈珊, 孙仁诚, 邵峰晶, 隋毅. 基于胶囊网络的动态路由研究与改进[J]. 计算机工程, 2022, 48(5): 208-214.
[7]	唐鑫, 徐彦彦, 潘少明. 基于图卷积神经网络的智能路由算法[J]. 计算机工程, 2022, 48(3): 38-45.
[8]	荆霞, 周子韬, 王永利. 针对复杂多环网络拓扑的路由改进算法[J]. 计算机工程, 2022, 48(3): 154-161.
[9]	王文欣, 贺煜航, 陈刚. 基于EM路由算法的医学图像分割UCaps网络[J]. 计算机工程, 2022, 48(2): 268-274.
[10]	刘博阳, 胡舒凯, 施得君, 卢宏生. VTFTR：高维胖树中的无死锁容错路由算法[J]. 计算机工程, 2022, 48(12): 38-44,53.
[11]	缪祎晟, 赵春江, 吴华瑞. 基于改进粒子群的农田WSN路由优化方法[J]. 计算机工程, 2022, 48(10): 218-223.
[12]	陈辉, 高岩. 基于双簇头的WSNs非均匀分簇路由算法[J]. 计算机工程, 2022, 48(10): 184-192.
[13]	任智, 周舟, 吴本源, 陈加林. 优化链路状态路由协议的低开销拓扑维护算法[J]. 计算机工程, 2021, 47(9): 120-127,135.
[14]	徐啸, 顾玲丽, 陈建平, 傅启明, 陆悠. 一种智能多路径路由及子流分配协同算法[J]. 计算机工程, 2021, 47(9): 136-144,152.
[15]	韩优佳, 胡黄水, 姚美琴. 基于信任感知的无线传感器网络安全路由协议[J]. 计算机工程, 2021, 47(9): 145-152.

选择文件类型/文献管理软件名称

选择包含的内容

内容分发网络中基于相关内容吸引的缓存算法

Cache Algorithm Based on Related Content Attracting in Content Delivery Network

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

内容分发网络中基于相关内容吸引的缓存算法

Cache Algorithm Based on Related Content Attracting in Content Delivery Network

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价