Inferring the average as path length of the Internet

Cun Wang, Zhengmin Li, Xiaohong Huang, Pei Zhang
{"title":"Inferring the average as path length of the Internet","authors":"Cun Wang, Zhengmin Li, Xiaohong Huang, Pei Zhang","doi":"10.1109/ICNIDC.2016.7974603","DOIUrl":null,"url":null,"abstract":"The average path length of the Internet autonomous system (AS) level topology was decreasing slightly in the last decade. Researches had shown that the average AS path length of the Internet was about 3.9 hops until 2012. However this inference was based on BGP routing tables collected from some vantage points that cannot cover the whole Internet. Researchers had also developed different methods to infer AS paths of the Internet, the easiest method considered the shortest paths as AS paths, but the reality is the ASes have self-defined routing policies which lead to a longer path than the shortest path. Other methods improved the inference accuracy. But they were also time consuming and difficult to be used in large scale. To explore the average AS path length of the Internet, we developed a new method to infer AS paths in a comparatively complete AS level topology. The core of this method was a path decision algorithm that simulated the packet transiting process for each AS in the Internet. The inference paths generated from this method were called as decision paths. The experimental results indicated that the decision paths were close to the actual AS paths especially for the path length distribution. At last, we discussed the effect of the incompleteness of peering links in the topology and inferred the average AS path length of the whole Internet using decision paths.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2016.7974603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

The average path length of the Internet autonomous system (AS) level topology was decreasing slightly in the last decade. Researches had shown that the average AS path length of the Internet was about 3.9 hops until 2012. However this inference was based on BGP routing tables collected from some vantage points that cannot cover the whole Internet. Researchers had also developed different methods to infer AS paths of the Internet, the easiest method considered the shortest paths as AS paths, but the reality is the ASes have self-defined routing policies which lead to a longer path than the shortest path. Other methods improved the inference accuracy. But they were also time consuming and difficult to be used in large scale. To explore the average AS path length of the Internet, we developed a new method to infer AS paths in a comparatively complete AS level topology. The core of this method was a path decision algorithm that simulated the packet transiting process for each AS in the Internet. The inference paths generated from this method were called as decision paths. The experimental results indicated that the decision paths were close to the actual AS paths especially for the path length distribution. At last, we discussed the effect of the incompleteness of peering links in the topology and inferred the average AS path length of the whole Internet using decision paths.
推断互联网的平均路径长度
近十年来,Internet自治系统(AS)级拓扑的平均路径长度略有下降。研究表明,截至2012年,互联网的AS路径长度平均约为3.9跳。然而,这种推断是基于从某些有利位置收集的BGP路由表,不能覆盖整个Internet。研究人员还开发了不同的方法来推断Internet上的AS路径,最简单的方法是将最短路径作为AS路径,但实际情况是AS有自定义的路由策略,导致路径比最短路径长。其他方法提高了推理精度。但它们也很耗时,而且难以大规模使用。为了探索互联网的AS平均路径长度,我们开发了一种新的方法来推断相对完整的AS层拓扑中的AS路径。该方法的核心是一种路径决策算法,该算法模拟了Internet中每个自治系统的数据包传输过程。该方法生成的推理路径称为决策路径。实验结果表明,该决策路径在路径长度分布上与实际AS路径较为接近。最后,我们讨论了对等链路不完备性对拓扑结构的影响,并利用决策路径推断出整个Internet的平均AS路径长度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信