朝着一个新的别名分辨率与空间搜索减少和IP指纹

J. Grailet, B. Donnet
{"title":"朝着一个新的别名分辨率与空间搜索减少和IP指纹","authors":"J. Grailet, B. Donnet","doi":"10.23919/TMA.2017.8002907","DOIUrl":null,"url":null,"abstract":"Since the early 2000's, the Internet Topology has been frequently described and modeled from the perspective of routers. To this end, alias resolution mechanisms have been developed in order to aggregate all IP interfaces of a router, collected with traceroute, into a single identifier. So far, many active measurement techniques have been considered, often taking advantage of specific features from network protocols. However, a lot of these methods have seen their efficiency decrease over time due to security reinforcements across the Internet. In this paper, we introduce a generic methodology to conduct efficient and scalable alias resolution. It combines the space search reduction of TreeNET (a tool for efficiently discovering subnets) with a fingerprinting process used to assess the feasibility of several state-of-the-art alias resolution methods, using a small, fixed amount of probes. We validate our method along MIDAR on an academic groundtruth and demonstrate that our methodology can achieve similar accuracy while using less probes and discovering subnets in the process. We further evaluate our method with measurements made on PlanetLab towards several distinct ASes of varying sizes and roles in the Internet. The collected data shows that some properties of our fingerprints correlate with each other, hinting some observed profiles could be linked with equipment vendors. Both TreeNET (which implements our methodology) and our dataset are freely available.","PeriodicalId":118082,"journal":{"name":"2017 Network Traffic Measurement and Analysis Conference (TMA)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Towards a renewed alias resolution with space search reduction and IP fingerprinting\",\"authors\":\"J. Grailet, B. Donnet\",\"doi\":\"10.23919/TMA.2017.8002907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the early 2000's, the Internet Topology has been frequently described and modeled from the perspective of routers. To this end, alias resolution mechanisms have been developed in order to aggregate all IP interfaces of a router, collected with traceroute, into a single identifier. So far, many active measurement techniques have been considered, often taking advantage of specific features from network protocols. However, a lot of these methods have seen their efficiency decrease over time due to security reinforcements across the Internet. In this paper, we introduce a generic methodology to conduct efficient and scalable alias resolution. It combines the space search reduction of TreeNET (a tool for efficiently discovering subnets) with a fingerprinting process used to assess the feasibility of several state-of-the-art alias resolution methods, using a small, fixed amount of probes. We validate our method along MIDAR on an academic groundtruth and demonstrate that our methodology can achieve similar accuracy while using less probes and discovering subnets in the process. We further evaluate our method with measurements made on PlanetLab towards several distinct ASes of varying sizes and roles in the Internet. The collected data shows that some properties of our fingerprints correlate with each other, hinting some observed profiles could be linked with equipment vendors. Both TreeNET (which implements our methodology) and our dataset are freely available.\",\"PeriodicalId\":118082,\"journal\":{\"name\":\"2017 Network Traffic Measurement and Analysis Conference (TMA)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Network Traffic Measurement and Analysis Conference (TMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/TMA.2017.8002907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Network Traffic Measurement and Analysis Conference (TMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/TMA.2017.8002907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

自2000年代初以来,互联网拓扑已经频繁地从路由器的角度进行描述和建模。为此,别名解析机制已经被开发出来,以便将一台路由器的所有IP接口(用traceroute收集)聚合成一个单一的标识符。到目前为止,已经考虑了许多主动测量技术,通常利用网络协议的特定功能。然而,由于Internet上的安全性增强,许多这些方法的效率随着时间的推移而降低。在本文中,我们介绍了一种通用的方法来进行高效和可扩展的别名解析。它将TreeNET(一种有效发现子网的工具)的空间搜索减少与指纹识别过程相结合,该过程用于评估几种最先进的别名解析方法的可行性,使用少量固定的探针。我们在学术基础上验证了我们在MIDAR上的方法,并证明我们的方法可以在使用更少的探针和发现子网的同时达到相似的精度。我们通过PlanetLab对互联网中不同规模和角色的几个不同的ase进行了测量,进一步评估了我们的方法。收集到的数据表明,我们的指纹的某些属性相互关联,暗示一些观察到的特征可能与设备供应商有关。TreeNET(它实现了我们的方法)和我们的数据集都是免费的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards a renewed alias resolution with space search reduction and IP fingerprinting
Since the early 2000's, the Internet Topology has been frequently described and modeled from the perspective of routers. To this end, alias resolution mechanisms have been developed in order to aggregate all IP interfaces of a router, collected with traceroute, into a single identifier. So far, many active measurement techniques have been considered, often taking advantage of specific features from network protocols. However, a lot of these methods have seen their efficiency decrease over time due to security reinforcements across the Internet. In this paper, we introduce a generic methodology to conduct efficient and scalable alias resolution. It combines the space search reduction of TreeNET (a tool for efficiently discovering subnets) with a fingerprinting process used to assess the feasibility of several state-of-the-art alias resolution methods, using a small, fixed amount of probes. We validate our method along MIDAR on an academic groundtruth and demonstrate that our methodology can achieve similar accuracy while using less probes and discovering subnets in the process. We further evaluate our method with measurements made on PlanetLab towards several distinct ASes of varying sizes and roles in the Internet. The collected data shows that some properties of our fingerprints correlate with each other, hinting some observed profiles could be linked with equipment vendors. Both TreeNET (which implements our methodology) and our dataset are freely available.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信