浏览全部资源
扫码关注微信
1. 东南大学 计算机科学与工程学院,江苏 南京 211189
2. 江苏省网络技术重点实验室,江苏 南京 211189
3. 计算机网络和信息集成教育部重点实验室,江苏 南京 211189
[ "胡晓艳(1985-),女,江西临川人,博士,东南大学讲师,主要研究方向为信息中心网络和网络管理。" ]
[ "龚俭(1957-),男,上海人,博士,东南大学教授、博士生导师,主要研究方向为网络体系结构、网络入侵检测和网络管理。" ]
网络出版日期:2015-10,
纸质出版日期:2015-10-25
移动端阅览
胡晓艳, 龚俭. 命名数据网络NDN的域间多路径路由机制[J]. 通信学报, 2015,36(10):211-223.
Xiao-yan HU, Jian GONG. Multipath inter-domain routing for named data networking[J]. Journal on communications, 2015, 36(10): 211-223.
胡晓艳, 龚俭. 命名数据网络NDN的域间多路径路由机制[J]. 通信学报, 2015,36(10):211-223. DOI: 10.11959/j.issn.1000-436x.2015258.
Xiao-yan HU, Jian GONG. Multipath inter-domain routing for named data networking[J]. Journal on communications, 2015, 36(10): 211-223. DOI: 10.11959/j.issn.1000-436x.2015258.
为实现命名数据网络(NDN
name data networking)域间内容互访,提出了一种NDN域间多路径路由机制——MIRNDN。该机制使任意自治系统(AS
autonomous system)仅维护自身及客户AS可达内容的路由信息并聚合路由信息以缓解域间路由的可扩展性问题;采用“无谷底”路由策略引导请求非自身和客户AS内容的Interest报文从多路径探索内容,且请求聚合、网络缓存和自适应转发能优化探索;维护多路径路由信息以支持 Interest多路径转发。从理论上分析了 MIRNDN 机制下 FIB 大小、路由更新的收敛时间和通信开销,在实际因特网 AS级别拓扑上的仿真实验表明 MIRNDN 缓解了域间路由的可扩展性问题,路由更新的收敛时间较短,通信开销适量,并有效地减少了Interest报文的不必要转发。
To facilitate content retrieval among NDN domains
a multipath inter-domain routing for named data networking(MIRNDN)was proposed.Under MIRNDN
an AS(autonomous system)maintained merely the routing state of content reachable from its own network or from its customers’ networks and aggregated routing information to mitigate routing scalability issue; “valley free”routing policy was applied to guide Interest packets that solicit content unreachable from the AS’s own network nor from its customers’ networks to explore matching data packets via multiple paths
and NDN’s requests aggregation
in-network caching and adaptive forwarding optimized such exploration; the reachability information of content from multiple paths was collected to support Interest multipath forwarding.The properties of FIB size and the convergence time and communication cost of routing update under MIRNDN were analyzed in theory.The experimental results in the AS level topology of current Internet validates that MIRNDN mitigates the scalability issue of NDN inter-domain routing
has relative short convergence time and moderate communication cost for routing update
and effectively reduces unnecessary Interest forwarding.
JACOBSON V , SMETTERS D , THORNTON J , et al . Networking named content [A ] . Proceedings of the 5th International Conference On Emerging Networking Experiments and Technologies [C ] . Rome,Italy , 2009 . 1 - 12 .
ZHANG L X , CLAFFY K , CROWLEY P , et al . Named data networking [J ] . ACM SIGCOMM Computer Communications Review , 2014 , 44 ( 3 ): 66 - 73 .
JACOBSON V , BURKE J , ESTRIN D , et al . Named Data Networking Project Annual Report [R ] . Technical Report NDN-0001 , 2010 .
CCNx project [EB/OL ] . http://www.ccnx.org http://www.ccnx.org , 2014 .
YI C , AFANASYEV A , WANG L , et al . Adaptive forwarding in named data networking [J ] . ACM SIGCOMM Computer Communications Review , 2012 , 42 ( 3 ): 62 - 67 .
DAI H C , LU J Y , WANG Y , et al . A two-layer intra-domain routing scheme for named data networking [A ] . IEEE Global Communications Conference 2012 [C ] . Anaheim,California,USA , 2012 . 1 - 6 .
TORRES J , FERRAZ L , DUARTE O . Controller-based Routing Scheme for Named Data Network [R ] . Technical Report,Electrical Engineering Program,COPPE/UFRJ , 2012 .
HOQUE M , AMIN S , ALYYAN A , et al . NLSR:named-data link state routing protocol [A ] . Proceedings of the 3th ACM SIGCOMM Workshop on Information-centric Networking [C ] . Hong Kong,China , 2013 . 15 - 20 .
DIBENEDETTO S , PAPADOPOULOS C , MASSEY D . Routing policies in named data networking [A ] . Proceedings of the First ACM SIGCOMM Workshop on Information-centric Networking [C ] . Toronto,Ontario,Canada , 2011 . 38 - 43 .
We knew the web was big [EB/OL ] . http://googleblog.blogspot.com/2008/07/ we-knew-webwas-big.html http://googleblog.blogspot.com/2008/07/ we-knew-webwas-big.html , 2008 .
GAO L . On inferring autonomous system relationships in the Internet [J ] . IEEE/ACM Transactions on Networking , 2001 , 9 ( 6 ): 733 - 745 .
HUSTON G . Interconnection,peering,and settlements [EB/OL ] . https://www.isoc.org/inet99/ proceedings/1e/1e_1.htm https://www.isoc.org/inet99/ proceedings/1e/1e_1.htm , 1999 .
BGP routing table analysis reports [EB/OL ] . http://bgp.potaroo.net/ http://bgp.potaroo.net/ , 2014 .
YI C , ABRAHAM J , AFANASYEV A , et al . On the role of routing in named data networking [A ] . Proceedings of the First ACM Conference on Information-Centric Networking [C ] . Paris,France , 2014 . 1 - 10 .
陈曦 . 基于BGP协议的NDN系统域间内容路由的研究与实现 [D ] . 北京邮电大学 , 2013 .
CHEN X . BGP Based Inter-Domain Content Routing for Named Data Networking [D ] . Beijing University of Posts and Telecommunications , 2013 .
PAPADOPOULOS F , KRIOUKOV D,BOGUÑÁ M . Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces [A ] . The IEEE Conference on Computer Communications 2010 [C ] . San Diego,CA , 2010 . 2973 - 2981 .
AFANASYEV A , MAHADEVAN P , MOISEENKO I . Interest flooding attack and countermeasures in named data networking [A ] . Proceedings of IFIP Networking 2013 [C ] . New York,USA , 2013 . 1 - 9 .
The CAIDA AS relationships dataset [EB/OL ] . http://www.caida.org/data/ request_ user_info_forms/as_relationships.xml http://www.caida.org/data/ request_ user_info_forms/as_relationships.xml , 2010 .
DIMITROPOULOS X , KRIOUKOV D , FOMENKOV M . As relationships:inference and validation [J ] . ACM SIGCOMM Computer Communications Review , 2007 , 37 ( 1 ): 29 - 40 .
0
浏览量
1466
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构