浏览全部资源
扫码关注微信
[ "杜传震,男,国家数字交换系统工程技术研究中心硕士生,主要研究方向为路由算法及优化、新型网络体系结构等。" ]
[ "兰巨龙,男,国家数字交换系统工程技术研究中心教授、博士生导师,国家重点基础研究发展计划(“973”计划)重点项目首席科学家,下一代广播电视网专项总体组专家,主要研究方向为宽带信息网络、网络与信息安全。" ]
[ "田铭,女,国家数字交换系统工程技术研究中心博士生,主要研究方向为路由算法及优化、新型网络体系结构等。" ]
网络出版日期:2014-04,
纸质出版日期:2014-04-20
移动端阅览
杜传震, 兰巨龙, 田铭. 一种面向邻近缓存的引导式内容路由机制[J]. 电信科学, 2014,30(4):46-53.
Chuanzhen Du, Julong Lan, Ming Tian. A Leading Routing Mechanism for Neighbor Content Store[J]. Telecommunications science, 2014, 30(4): 46-53.
杜传震, 兰巨龙, 田铭. 一种面向邻近缓存的引导式内容路由机制[J]. 电信科学, 2014,30(4):46-53. DOI: 10.3969/j.issn.1000-0801.2014.04.007.
Chuanzhen Du, Julong Lan, Ming Tian. A Leading Routing Mechanism for Neighbor Content Store[J]. Telecommunications science, 2014, 30(4): 46-53. DOI: 10.3969/j.issn.1000-0801.2014.04.007.
针对命名数据网络(NDN)内容请求节点容易忽略邻近节点缓存的问题,基于节点兴趣集群思想,提出一种面向邻近缓存的引导式便捷内容路由机制。首先通过构建节点兴趣集群将节点分为若干区域进行缓存通告;然后设计报文与便捷路由转发表项;最后选择最优路径发送请求数据。理论分析与仿真结果表明,该机制能够充分利用邻近节点缓存,有效地降低了用户平均时延,服务器负载减少约30%。
It is very easy for the nodes in named data networking to ignore the neighbor nodes. To solve this issue
a leading routing mechanism for neighbor content store was proposed. Firstly
through building the interest clusters
the nodes were partitioned to different reigns to announce the information of content store. Secondly
the packets and the fast routing tables were designed. Finally
the best path was chosen to send the interest packets. The theoretical analysis and simulation results show that
this mechanism adequately uses the neighbor content and effectively decreases the average network delay. The server load is reduced by 30%.
Muscariello L , Carofiglio G , Gallo M . Bandwidth and storage sharing performance in information centric networking . Proceedings of ACM SIGCOMM ICN Workshop , Toronto, ON, Canada , 2011 : 26 ~ 31
Tsilopoulos C , Xylomenos G . Supporting diverse traffic types in information centric networks . Proceedings of ACM SIGCOMM ICN Workshop , Toronto, ON, Canada , 2011 : 13 ~ 18
Zhang L X , Estrin D , Burke J , et al . Named data networking (NDN)project . http://named-data.net/techreports.html http://named-data.net/techreports.html , http://named-data.net/techreports.html , 2013
Shanbhag S , Schwan N , Rimac I , et al . SoCCeR: services over content-centric routing . Proceedings of ACM SIGCOMM Workshop on Information-Centric Networking , Toronto, Canada , 2011 : 62 ~ 67
Chiocchetti R , Rossi D , Carofiglio G , et al . Exploit the known or explore the unknown? Hamlet-like doubts in ICN . Proceedings of ACM SIGCOMM ICN Workshop , Helsinki,Finland , 2012 : 7 ~ 12
Eum S , Nakauchi K , Murata M , et al . CATT: potential based routing with content caching for ICN . Proceedings of ACM SIGCOMM Workshop on Information-Centric Networking , Helsinki, Finland , 2012 : 49 ~ 54
叶润生 , 徐明伟 . 命名数据网络中的邻居缓存路由策略 . 计算机科学与探索 , 2012 , 6 ( 7 ): 593 ~ 601
Wang Y , Lee K , Venkataraman B , et al . CAdvertising cached contents in the control plane: necessity and feasibility . Proceedings of IEEE INFOCOM, NOMEN Workshop , Orlando, Florida, USA , 2012 : 286 ~ 291
Sripanidkulchai K , Maggs B , Zhang H . Efficient content location using interest-based locality in peer-to-peer systems . Proceedings of IEEE INFOCOM, NOMEN Workshop , San Franciso, CA, USA , April 2003
Pireddo L , Nascimento M A . Taxonomy-based routing indices for peer-to-peer networks . Proceedings of the SIGIR Workshop on Peer-to-Peer Information Retrieval, the 27th Annual International ACM SIGIR Conference , Sheffield, UK , July 2004
Mcpherson M , Lovin L , Cook J . Birds of a feather: homophily in social networks . Annual Review of Sociology , 2001 , 27 ( 1 ): 415 ~ 444
Zhang Y , Zhao J , Cao G H , et al . On interest locality in content-based routing for large-scale MANETs . Proceedings of IEEE 6th International Conference on Mobile Ad Hoc and Sensor Systems(MASS ˊ09) , Macao, China , 2009
Berners-Lee T , Fielding R T , Masinter L . Uniform Resource Identifier(URI): Generic Syntax . RFC3986 , 2005
0
浏览量
464
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构