Topology Discovery at the Router Level: A New Hybrid Tool Targeting ISP Networks

Marchetta, Pietro; Mérindol, Pascal; Donnet, Benoît; Pescapè, Antonio; Pansiot, Jean‐Jacques

doi:10.1109/jsac.2011.111003

Cited by 35 publications

(28 citation statements)

References 23 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In some cases, it can be very useful: almost 30% of alias pairs were obtained with this method on AS10010 on April 14 th , 2017. 11 Moreover, since not all interfaces of a router partially discovered through the address-based method will reply to 10 Transit filtering has already been observed for IGMP probing [12]. 11 See https://github.com/JefGrailet/treenet/tree/master/v3/Measurements/ UDP, we can rely on the IP-ID-based methods (when possible) to build a larger, more accurate alias.…”

Section: Alias Resolutionmentioning

confidence: 99%

“…In particular, we focus on active techniques (i.e., done at the same time as traceroute or shortly after, with additional probing) rather than passive approaches. Such approaches range from analytical methods like in-depth analysis of traceroute records, as implemented in kapar [9], to lightweight probing like IGMP probing [11]. The latter has the advantage of silently collecting all multicast interfaces of a router in a single probe.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Towards a renewed alias resolution with space search reduction and IP fingerprinting

Grailet

Donnet

2017

2017 Network Traffic Measurement and Analysis Conference (TMA)

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Alias Resolutionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Towards a renewed alias resolution with space search reduction and IP fingerprinting

Grailet

Donnet

2017

2017 Network Traffic Measurement and Analysis Conference (TMA)

Self Cite

View full text Add to dashboard Cite

show abstract

“…It only processes the first packets (there is no continuation . Merlin global overview [120] flag forcing the wait for the remaining fragments). Mérindol et al have observed this behavior on large degree CISCO routers.…”

Section: Merlinmentioning

confidence: 99%

“…If Merlin is still based on recursive IGMP probing, it also improves mrinfo and mrinfo-rec by probing from several vantage points, each one being managed by a central server [120], in order to increase the exploration coverage while limiting the probing redundancy. Fig.…”

Section: Merlinmentioning

confidence: 99%

“…How a network can be represented as a router graph and a subnet graph [124] (transit filtering). While the second problem can be reduced with the use of multiple vantage points in a cooperative distributed platform [120], the first one is more challenging as it impacts the collected topologies. Indeed, multicast routers that do not respond to IGMP probes may divide the resulting collected multicast graph into disjoint components.…”

Section: Igmp Probing Limitationsmentioning

confidence: 99%

See 1 more Smart Citation

Internet Topology Discovery

Donnet

2013

Data Traffic Monitoring and Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. Since the nineties, the Internet has seen an impressive growth, in terms of users, intermediate systems (such as routers), autonomous systems, or applications. In parallel to this growth, the research community has been looking for obtaining and modeling the Internet topology, i.e., how the various elements of the network interconnect between themselves. An impressive amount of work has been done regarding how to collect data and how to analyse and model it. This chapter reviews main approaches for gathering Internet topology data. We first focus on hop limited probing, i.e., traceroute-like probing. We review large-scale tracerouting projects and discuss traceroute limitations and how they are mitigated by new techniques or extensions. Hop limited probing can reveal an IP interface vision of the Internet. We next focus on techniques for aggregating several IP interfaces of a given router into a single identifier. This leads to a router level vision of the topology. The aggregation can be done through a process called alias resolution. We also review a technique based on IGMP probing that silently collect all multicast interfaces of a router into a single probe. We next refine the router level topology by adding subnet information. We finish this chapter by discussing the AS level topology, in particular the relationships between ASes and the induced hierarchy.

show abstract