期刊文献+

基于BGP路由表的域间路径特性实验研究 被引量:5

Experimental study of BGP routing-table-based inter-domain path characteristics
原文传递
导出
摘要 边界网关协议(BGP)路由表中存放的相关信息可以反映互联网规模、运行状态及其体系结构的演化,是互联网基础性研究的重要组成部分,然而先前对BGP路由表的研究工作主要集中于路由表尺寸、网络覆盖范围和地址空间消耗等反映互联网规模的指标,对路径多样性等方面的研究比较缺乏。该文基于BGP IPv4路由表,引入域间路径特性分析模型,设计路径特性分析实验框架,开展了针对自治系统(AS)规模以及域间路径特性的统计分析工作,获得了隐藏的AS级路径属性及其参数分布。研究结果显示:现今互联网物理网络具有丰富的路径多样性;BGP选择的部分默认路径并非最短路径。该结果对于指导互联网域间路由的研究具有重要的意义。 The information stored in the routing table for the border gateway protocol (BGP) can reflect the scale of the Internet, the running state and the evolution of the architecture, which is important for basic research of the Internet. Previous studies of routing tables have mainly focused on the indicators that reflect the Internet scale, such as the routing table size, the Internet coverage, and the address consumption, but lack analyses of routing diversity. This paper introduces a characteristic analysis model for inter-domain paths and a path characteristic analysis framework based on the IPv4 routing table information in the BGP with statistical analyses of the AS scale and the inter-domain path characteristics. The results give information about the AS-level path attributes and their parameter distributions. The analyses show that the lnternet currently has a rich diversity of routing paths with some best paths selected by BGP not the shortest paths in the routing table. The results provide guidance for future inter-domain route planning.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2015年第11期1190-1196,共7页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(61170211,61462009) 国家教育部博士点专项基金项目(20110002110056,20130002110058) 广西自然科学基金项目(2014GXNSFAA118358)
关键词 边界网关协议 路径分析模型 路径多样性 路径长度 border gateway protocol path analysis model path diversity path length
  • 相关文献

参考文献12

  • 1Huston G. Analyzing the Internet's BGP routing table ~J3. The Internet Protocol Journal, 2001, 4(1) :2 - 15.
  • 2Huston G. BGP table report ['EB/OL]. [,2013-01-15]. http:// bgp. potaroo, net.
  • 3Smith P. Routing summaries at APNIC [EB/OL]. [,2013-01-15]. http://www, apnic, net/stats/bgp.
  • 4The University of Oregon's Advanced Network Technology Center. University of Oregon Route Views Project. [EB/OL]. ['2013-01-15]. http://www, routeviews, org/.
  • 5Huston G. AS6447 BGP routing table analysis reports [EB/OL]. ['2009-11-09]. http://bgp, potaroo, net~as6447~.
  • 6Nayak K,Mckeman D. Measuring provider path diversity from traceroute data: Work in progress [EB/OL]. [2009-11-091. http://www, eaida, org/workshops/isma/ 0112/talks/krishna/.
  • 7Teileira R. Marzullo K, Savage S, et al. In search of path diversity in ISP networks f-C] // proc of ACM SIGCOMM 2003. New York, NY, USA: ACM, 2003: 313-318.
  • 8Teileira R, Marzullo K, Savage S, et al. Characterizing and measuring path diversity of Internet topologies [C] //Proc of ACM SIGMETRICS 2003. New York, NY, USA: ACM, 2003~ 304 - 305.
  • 9Zheng H, Lua E, Pias M, et al. Internet routing policies and round-trip times [C~// Proc of 6th International Workshop on Passive and Active Network Measurement. Boston, MA, USA, 2005.. 236-250.
  • 10Wang G, Zhang B. Towards network triangle inequality violation aware distributed systems [C~// Proc of the ACM/IMC Conference. San Diego, CA, USA: ACM, 2007: 175 - 188.

同被引文献30

  • 1陈军华,王忠民.BGP/MPLS VPN实现原理[J].计算机工程,2006,32(23):124-126. 被引量:17
  • 2Yah X, Han J. Close graph:Mining closed frequent graph patterns[C]//Proceedings of the Ninth ACM SIGKDD In- temational Conference On Knowledge Discovery And Data Mining. Washington DC : ACM ,2003:286 - 295 ,.
  • 3Yan X, Han J. Gspan :Graph-based substructure pattern min-ing[ C ]//Proceedings of 2002 IEEE International Confer- ence on Data Mining. Melbourne : IEEE ,2002:721 - 724.
  • 4Holder L B, Cook D J, Djoko S. Substructure discovery in the subdue system [ C ]//Proceedings of ACM SIGKDD the 1994 International Conference on Knowledge Discovery in Database( KDD' 94). Seattle : ACM, 1994 : 169 - 180.
  • 5Inokuchi A, Washin T, Motoda H. An Apriori-based algo- rithm for mining frequent substructures from graph data [ C ]//Proceedings of the 2000 Europe Conference on Prin- ciple of Data Mining and Knowledge Discovery(PKDD). Ly- on : Springer,2000 : 13 - 23.
  • 6Kuramochi M, Karypis G. Frequent subgraph discovery [ C]// Proceedings of IEEE the 2001 International Confer- ence on Data Mining(ICDM). San Jose : IEEE, 2001 : 313 - 320.
  • 7Kang U,Tsourakakis C E, Faloutsos C. Pegasus :A peta-scale graph mining system implementation and observations [ C 1// Proceedings of the 2009 Ninth IEEE International Confer- ence on Data Mining. Miami : IEEE ,2009:229 - 238.
  • 8Kang U, Meeder B, Faloutsos C. Spectral analysis for billion- scale graphs: Discoveries and implementation [ C ]//Pro- ceedings of the 15th Pacific-Asia Conference on Advances inKnowledge Discovery and Data Mining. Shenzhen: Springer, 2011:13 -25.
  • 9Pagh R, Tsourakakis C E. Colorful triangle counting and a mapreduce implementation [ J ]. Information Processing Let- ters,2012,112 (7) :277 - 281.
  • 10Afrati F, Fotakis D, Ullman J. Enumerating subgraph stances using map-reduce [ C ]//Proceedings of 2013 IEEE 29th International Conference on Data Engineering (IC- DE). Brisbane : IEEE,2013:62 - 73.

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部