一种基于时空可信度推断AS商业关系的方法
Method for Inferring AS Relationship Based on Temporal and Spatial Reliability
DOI: 10.12677/SEA.2016.51005, PDF, HTML, XML, 下载: 2,104  浏览: 6,389  国家科技经费支持
作者: 刘 磊, 朱培栋, 胡照明:国防科学技术大学计算机学院,湖南 长沙
关键词: AS商业关系可信度方法AS Relationship Reliability Method
摘要: 本文提出了一种基于时空可信度的AS商业关系推断方法,该方法选取多个时间点的不同监测点路由表,基于路由策略和层次结构初步推断每个时刻不同监测点的AS商业关系,并基于空间一致性和时间稳定性计算其可信度值,根据给定阈值选取可信的AS商业关系。同时,本文还分析了路由监测点数量与阈值对有效AS商业关系推断的影响。实验结果表明,选取恰当数量的路由监测点与阈值可以有效提高AS商业关系的精准度。
Abstract: In this paper, a new method of inferring AS relationship by analyzing the temporal and spatial reliability is proposed. Firstly, the method selects the routing tables which originate from different monitored points in different intervals. Based on the routing strategy and the hierarchical structure, the AS relationship of different monitored points is inferred in every time window. Moreover, we define and calculate the value of the temporal and spatial reliability by analyzing the spatial consistency and time stability. Furthermore, we set a threshold and regard any AS relationship with reliability value greater than the threshold as trusted relationship. In the meanwhile, we analyze the number of monitored points and the threshold to infer the influence on AS relationship’s validity. Experiment result shows that the accuracy of AS relationship deduction can be largely improved by selecting appropriate number of routing monitored points and the threshold value through our proposed methods.
文章引用:刘磊, 朱培栋, 胡照明. 一种基于时空可信度推断AS商业关系的方法[J]. 软件工程与应用, 2016, 5(1): 38-46. http://dx.doi.org/10.12677/SEA.2016.51005

参考文献

[1] Chen, E. (2004) BGP Support for Four-Octet AS Number Space. IETF Internet-Draft-4893, December 2004.
[2] Gao, L. (2001) On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Transactions on Networking, 9, 733-745.
http://dx.doi.org/10.1109/90.974527
[3] Subramanian, L., Agarwal, S., Rexford, J. and Katz, R.H. (2002) Characterizing the Internet Hierarchy from Multiple Vantage Points. Proceedings of IEEE 21st Annual Joint Conference of the IEEE Computer and Communications Societies, 2, 618-627.
http://dx.doi.org/10.1109/infcom.2002.1019307
[4] Di Battista, G., Erlebach, T., Hall, A., et al. (2007) Computing the Types of the Relationships between Autonomous Systems. IEEE/ACM Transactions on Networking, 15, 267-280.
http://dx.doi.org/10.1109/TNET.2007.892878
[5] Dimitropoulos, X., Krioukov, D., Fomenkov, M., et al. (2007) AS Relationships: Inference and Validation. ACM SIGCOMM Computer Communication Review, 37, 29-40.
http://dx.doi.org/10.1145/1198255.1198259
[6] Zhang, B., Liu, R., Massey, D., et al. (2005) Collecting the Internet AS-Level Topology. ACM SIGCOMM Computer Communication Review, 35, 53-61.
http://dx.doi.org/10.1145/1052812.1052825
[7] Oliveria, R., Pei, D., Willinger, W., Zhang, B. and Zhang, L. (2008) Quantifying the Completeness of the Observed Internet AS-Level Structure. Technical Report TR-080026-2008, UCLA CS Dept.
[8] Bron, C. and Kerbosch, J. (1973) Finding All Cliques of an Undirected Graph. Communications of the ACM, 16, 575- 576.
http://dx.doi.org/10.1145/362342.362367
[9] Gregori, E., Improta, A., Lenzini, L., et al. (2011) BGP and Inter-AS Economic Relationships. NETWORKING 2011. Springer Berlin Heidelberg, 54-67.
[10] Rekhter, Y. and Li, T. (1994) A Border Gateway Protocol 4 (BGP-4). RFC.
http://dx.doi.org/10.17487/rfc1654
[11] 王洪君, 于晓鹏. 一种BGP无效路由检测方法[J]. 吉林师范大学学报: 自然科学版, 2008(3) :54-57.
[12] Luckie, M. (2014) Spurious Routes in Public BGP Data. ACM SIGCOMM Computer Communication Review, 44, 14- 21.
http://dx.doi.org/10.1145/2656877.2656880
[13] 邓文平, 郭敏, 胡晓峰, 等. 互联网AS拓扑的结构与连通性研究[J]. 计算机工程与科学, 2012, 34(6): 1-6.
[14] Mayer, D. (2015) University of Oregon Route Views Project. http://www.routeviews.org
[15] Route Views Project (2015) Route-Views Data. http://www.routeviews.org/data.html