Quantifying and mitigating IGMP filtering in topology discovery

Recent developments in router level topology discovery have suggested the introduction of IGMP probing in addition to standard techniques such as traceroute and alias resolution. With a single IGMP probe, one can obtain all multicast interfaces and links of a multicast router. If such a probing is a promising approach, we noticed that IGMP probes are subject to filtering, leading so to the fragmentation of the collected multicast graph into several disjoint connected components. In this paper, we cope with the fragmentation issue. Our contributions are threefold: (i) we experimentally quantify the damages caused by IGMP filtering on collected topologies of large tier-1 ISPs; (ii) using traceroute data, we construct a hybrid graph and estimate how far each IGMP fragment is from each other; (iii) we provide and experimentally evaluate a recursive approach for reconnecting disjoint multicast components. The key idea of the third contribution is to recursively apply alias resolution to reassemble disjoint fragments and, thus, progressively extend the mapping of the targeted ISP. Data presented in the paper, as well as reconstructed topologies, are freely available at http://svnet.u-strasbg.fr/merlin.

[1]  Benoit Donnet,et al.  Internet topology discovery: a survey , 2007, IEEE Communications Surveys & Tutorials.

[2]  Kamil Saraç,et al.  Resolving Anonymous Routers in Internet Topology Measurement Studies , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Antonio Pescapè,et al.  Topology Discovery at the Router Level: A New Hybrid Tool Targeting ISP Networks , 2011, IEEE Journal on Selected Areas in Communications.

[4]  Ken Keys,et al.  Internet-scale IP alias resolution techniques , 2010, CCRV.

[5]  Benoit Donnet,et al.  MERLIN: MEasure the router level of the INternet , 2011, 2011 7th EURO-NGI Conference on Next Generation Internet Networks.

[6]  Olivier Bonaventure,et al.  Quantifying ases multiconnectivity using multicast information , 2009, IMC '09.

[7]  Thomas E. Anderson,et al.  Resolving IP aliases with prespecified timestamps , 2010, IMC '10.

[8]  Yajun Wang,et al.  Network Topology Inference Based on End-to-End Measurements , 2006, IEEE Journal on Selected Areas in Communications.

[9]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[11]  Fangzhe Chang,et al.  Topology inference in the presence of anonymous routers , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Brice Augustin,et al.  Avoiding traceroute anomalies with Paris traceroute , 2006, IMC '06.