Towards an accurate AS-level traceroute tool

Mao, Z. Morley; Rexford, Jennifer; Wang, Jia; Katz, Randy H.

doi:10.1145/863955.863996

Cited by 249 publications

(209 citation statements)

References 19 publications

Supporting

Mentioning

204

Contrasting

Order By: Relevance

“…Mao et al provide mechanisms for improving the IP-to-AS mapping [15,16]. Their techniques are based on several information sources: traceroute, BGP update, BGP table dumps, and reverse DNS lookup.…”

Section: Related Workmentioning

confidence: 99%

Extracting Intra-domain Topology from mrinfo Probing

Pansiot

Mérindol

Donnet

et al. 2010

Passive and Active Measurement

View full text Add to dashboard Cite

Abstract. Active and passive measurements for topology discovery have known an impressive growth during the last decade. If a lot of work has been done regarding inter-domain topology discovery and modeling, only a few papers raise the question of how to extract intra-domain topologies from measurements results. In this paper, based on a large dataset collected with mrinfo, a multicast tool that silently discovers all interfaces of a router, we provide a mechanism for retrieving intra-domain topologies. The main challenge is to assign an AS number to a border router whose IP addresses are not mapped to the same AS. Our algorithm is based on probabilistic and empirical IP allocation rules. The goal of our pool of rules is to converge to a consistent router to AS mapping. We show that our router-to-AS algorithm results in a mapping in more than 99% of the cases. Furthermore, with mrinfo, point-to-point links between routers can be distinguished from multiple links attached to a switch, providing an accurate view of the collected topologies. Finally, we provide a set of large intra-domain topologies in various formats.

show abstract

Section: Related Workmentioning

confidence: 99%

Extracting Intra-domain Topology from mrinfo Probing

Pansiot

Mérindol

Donnet

et al. 2010

Passive and Active Measurement

View full text Add to dashboard Cite

show abstract

“…Note that we cannot use the AS-level traceroute tool [16,17] in the estimation of the P matrix, because that technique cannot report the degree of padding in an AS path.…”

Section: -Lgs In a Customer Of Smentioning

confidence: 99%

Interdomain Ingress Traffic Engineering Through Optimized AS-Path Prepending

Gao

Dovrolis

Zegura

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In INterdomain Ingress Traffic Engineering (INITE), a "target" Autonomous System (AS) aims to control the ingress link at which the traffic of one or more upstream source networks enters that AS. In practice, ISPs often manipulate, mostly in a trial-and-error manner, the length of the AS-Path attribute of upstream routes through a simple technique known as prepending (or padding). In this paper, we focus on prepending and propose a polynomial-time algorithm (referred to as OPV) that determines the optimal padding for an advertised route at each ingress link of the target network. Specifically, given a set of "elephant" source networks and some maximum load constraints on the ingress links of the target AS, OPV determines the minimum padding at each ingress link so that the load constraints are met, when it is feasible to do so. OPV requires as input an AS-Path length estimate from each source network to each ingress link. We describe how to estimate this matrix, leveraging the BGP Looking Glass Servers. To deal with unavoidable inaccuracies in the AS-Path length estimates, and also to compensate for the generally unknown BGP tie-breaking process in upstream networks, we also develop a robust variation (RPV) of the OPV algorithm.

show abstract

“…"s in our data: !H (host unreachable) and !X (communication administrative prohibited). In [21], Mao et al, describe several heuristics to interpret and thereby reduce the number of "*"s and "! "s in observed traceroute data.…”

Section: A Methodologymentioning

confidence: 99%

“…In our work, however, our goal is to map every AS on a forward path to an AS on its reverse counterpart. Furthermore, since the comparison in [21] simply attempts to declare whether or not a match is seen (a yes or no criterion), a few mis-interpreted "*" or "!" may not change the results considerably.…”

Section: A Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Quantifying routing asymmetry in the internet at the AS level

Faloutsos

Krishnamurthy

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

In this paper, our objective is to quantify the extent of the routing asymmetry in the Internet: the measure of the difference between the forward and backward paths between two end points. Routing asymmetry has not been studied extensively. Most of the previous studies only consider asymmetry in terms of length and there is a lack of a systematic approach for quantifying asymmetry. One of the challenges in quantifying asymmetry is the formulation of an appropriate set of metrics that can effectively capture various notions of asymmetry. We point out that asymmetry could be of various types. We propose a framework to quantify the routing asymmetry between end hosts and propose two new metrics: Absolute Asymmetry and length-based Normalized Asymmetry. Our metrics capture the differences in (a) the identities of the entities along the forward and reverse paths, (b) the sequence in which the entities appear on the paths and (c) the path length in a seamless way. We apply our framework to real Internet measurement data and examine routing asymmetry at the Autonomous System (AS) level. We deduce the routing asymmetry distribution based on our framework, and we find that about 14% of pairs of routes considered display AS level routing asymmetry. Furthermore, our studies demonstrate that the routing asymmetry exhibits a skewed distribution, since a few end-points are consistently members of asymmetric pairs. Abstract-In this paper, our objective is to quantify the extent of the routing asymmetry in the Internet: the measure of the difference between the forward and backward paths between two end points. Routing asymmetry has not been studied extensively. Most of the previous studies only consider asymmetry in terms of length and there is a lack of a systematic approach for quantifying asymmetry. One of the challenges in quantifying asymmetry is the formulation of an appropriate set of metrics that can effectively capture various notions of asymmetry. We point out that asymmetry could be of various types. We propose a framework to quantify the routing asymmetry between end hosts and propose two new metrics: Absolute Asymmetry and length-based Normalized Asymmetry. Our metrics capture the differences in (a) the identities of the entities along the forward and reverse paths, (b) the sequence in which the entities appear on the paths and (c) the path length in a seamless way. We apply our framework to real Internet measurement data and examine routing asymmetry at the Autonomous System (AS) level. We deduce the routing asymmetry distribution based on our framework, and we find that about 14% of pairs of routes considered display AS level routing asymmetry. Furthermore, our studies demonstrate that the routing asymmetry exhibits a skewed distribution, since a few end-points are consistently members of asymmetric pairs. Keywords ASYMMETRY, ROUTING, INTERNET, MEASUREMENT, FRAMEWORK, AUTONOMOUS SYSTEM The paper is intended for Global Internet & Next-Generation Networks Symposium Quantifying Routing Asymmetry in the Int...

show abstract

Towards an accurate AS-level traceroute tool

Cited by 249 publications

References 19 publications

Extracting Intra-domain Topology from mrinfo Probing

Extracting Intra-domain Topology from mrinfo Probing

Interdomain Ingress Traffic Engineering Through Optimized AS-Path Prepending

Quantifying routing asymmetry in the internet at the AS level

Contact Info

Product

Resources

About