Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring ASlevel Internet topology from router-level path traces," in Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... A key contribution of this paper is a method for inferring the topology of a specific AS from a traceroute derived router level map (Section II B) Previous approaches for doing this have relied upon inferring the AS to which a router belongs from the origin AS information in BGP tables [29] [14]. As we show, the BGP derived AS information can significantly overestimate (sometimes by a factor of 10 or more) the number of routers in a large AS. In this paper, we describe an approach to extracting AS topology that leverages some current practices in Internet address assignment and routing. ....

....at routers. That is, a router is entirely owned by a single AS. Then, the problem of extracting AS reduces to determining whether a given router belongs to or not. We first consider the simpler step of determining whether a given IP address belongs to or not. To do this, previous work [29] [14] has used information from the BGP routing table[3] and from the RADB database[23] The BGP table indicates which set of IP addresses have AS as their origin. More precisely, a little bit more than 1 second apart to avoid being subject to ICMP rate limiting. However, it is well known that many ....

H. Chang, S. Jamin, and W. Willinger. Inferring AS-Level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001.

.... Previous work have labeled a link as interdomain if the routers it connects are assigned to different ASes, and intradomain otherwise [39] 3] A problem with such an approach is that border routers are often assigned an IP address from a neighboring ASs address space, as detailed in [6]. Therefore, we instead study links that cross address spaces and links that lie within the same address space. The properties of these links in the Skitter dataset are shown in Table VI. This table shows that about half of all links in our dataset lie within the continental US. With respect to ....

H. Chang, S. Jamin, and W. Willinger. Inferring AS-Level Internet Topology From Router-Level Path Traces. In Proceedings of SPIE ITCom '01, Scalability and Traffic Control in IP Networks, August 2001.

....to test the hypothesis that many of the mismatches stem from IXPs and siblings; in contrast, our paper proposes heuristics for identifying IXPs, siblings, and other causes of mismatches to improve the IP to AS mapping. To improve the accuracy of AS graphs derived from traceroute, the work in [18] proposed techniques that identify border routers between ASes to correct mistaken AS mappings; this is an alternate approach that handles some of the inaccuracy introduced by IP to AS mappings derived from BGP tables. Traceroute data have been used in other studies that measure router level ....

....more common, the notion of origin AS would become increasingly ambiguous. We plan to investigate the sensitivity of our results to these factors. Converting an IP level path to an AS level path is extremely difficult, and additional measurement data would help. An accurate router level graph [18, 4, 5, 6] would allow us to map interfaces to routers and, in turn, map routers to ASes. This would make our techniques less vulnerable to the interface numbering at AS boundaries (Section 6.2) and the source IP address in ICMP messages (Section 6.3) Although challenging in its own right, collecting the ....

Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring AS-level internet topology from router-level path traces," in Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.

.... all IP addresses assigned to the interfaces of a single router using the alias probe heuristic of [26] A further router identification technique was implemented in iffinder, a tool developed by Ken Keys at CAIDA [27] Chang et al. tackled the problem of identifying which AS owns a router [28], introducing heuristics to fill in ASes for non replying hops in the trace. The paper also discusses third party addresses addresses belonging to an AS in the return path that does not appear in the forward traceroute path. Our analysis [29] suggests that this is a negligible source of AS path ....

H.Chang, S.Jamin, and W.Willinger, "Inferring AS-level Internet topology from router-level path traces," in Scalability and tra#c control in IP networks, Aug 2001, Proceeding of SPIE, vol.4526.

....AS degrees is to annotate a router level map with each router s associated autonomous system. Nodes in the router level graph are labeled using IP addresses. In the overlay produced by annotating the routerlevel graph, each node is further labeled with its assocated AS. The approach is detailed in [10]; we summarize the approach here. An IP is associated with an autonomous system by performing a lookup in BGP tables. First, find the longest matching prefix of an IP address within the BGP table; the last entry in the path vector is the number of the AS which owns that IP address. A complete ....

H. Chang, S. Jamin, and Walter Willinger. Inferring AS-level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001.

....AS degrees is to annotate a router level map with each router s associated autonomous system. Nodes in the router level graph are labeled using IP addresses. In the overlay produced by annotating the routerlevel graph, each node is further labeled with its assocated AS. The approach is detailed in [10]; we summarize the approach here. An IP is associated with an autonomous system by performing a lookup in BGP tables. First, find the longest matching prefix of an IP address within the BGP table; the last entry in the path vector is the number of the AS which owns that IP address. A complete ....

H. Chang, S. Jamin, and Walter Willinger. Inferring AS-level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001.

....assigned to the interfaces of a single router. To that end, the alias probe heuristic of [38] was used. This router identification technique was also implemented in iffinder, a tool developed by Ken Keys at CAIDA [39] Chang et al. tackled the problem of identifying which AS owns a router [40], introducing heuristics that fill in ASes for non replying hops in the trace. Their paper also discusses third party addresses. Our analysis suggests that these are a negligible source of AS path incongruity. Ratul Mahajan et al. 41] studied BGP misconfigurations. Third party addresses are not ....

H.Chang, S.Jamin, and W.Willinger, "Inferring AS-level Internet topology from router-level path traces," in Scalability and traffic control in IP networks, Aug 2001, Proceeding of SPIE, vol.4526.

....3 new nodes and 4 new links per destination, up to 1300 destinations. With this small number of destinations, it is unclear how the marginal gain applies with the larger set of target prefixes our work examines. Chang et al. use traceroute data to infer relationships between autonomous systems [13]. Compared to passively using BGP tables, this active method can discover multiple links between ASs, and see through aggregation at ISP borders. We have not examined the ability of clustering to identify groups of prefixes from remote ASs that are likely shared at the same peering link, but it ....

Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring AS-level Internet topology from router-level path traces," in Proc. of SPIE ITCom, Aug. 2001, pp. 19--24.

....information from real datasets. We have already mentioned [10] 17] who associate peering relationships with edges in the ASlevel topology, and the work in [10] 17] who aim to characterize hierarchy. Chang et al. describe a method for inferring AS level topology from router level path traces [15]. Such a technique has the potential to allow one to bring semantic information from the router level data up to the AS level topology (e.g. estimates of the number of routers in an AS) however the Chang work primarily focuses on the important task of identifying border routers and not on ....

Hyunseok Chang Sugih Jamin. Inferring as-level internet topology from router-level path traces.

.... an emphasis on quantifying the inflation in route lengths [16] 31] 28] At a higher level of abstraction, there has been considerable work on understanding AS level connectivity [13] 4] including work which leverages traceroute measurements and BGP routes to help infer AS Level connectivity [7], 6] These pieces of work, like ours, emphasize the importance of incorporating snapshots taken from multiple vantage points to providing the most complete reflection of the overall topology. III. DEFINITIONS AND OBJECTIVES The network discovery problems we consider have a natural ....

H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet Topology from Router-level Traceroutes. In Proceedings of SPIE ITCom '01, Scalability and Traffic Control in IP Networks, August 2001.

.... an emphasis on quantifying the inflation in route lengths [16] 31] 28] At a higher level of abstraction, there has been considerable work on understanding AS level connectivity [13] 4] including work which leverages traceroute measurements and BGP routes to help infer AS Level connectivity [7], 6] These pieces of work, like ours, emphasize the importance of incorporating snapshots taken from multiple vantage points to providing the most complete reflection of the overall topology. III. DEFINITIONS AND OBJECTIVES The network discovery problems we consider have a natural ....

H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet Topology from Router-level Traceroutes. In Proceedings of SPIE ITCom '01, Scalability and Traffic Control in IP Networks, August 2001.

....the AS topology from November 8, 1997 to March 16, 2001 taken roughly every 3 months. We treat the graphs as simple, undirected graphs, i.e. we remove parallel links. We note that an alternative approach to determining the AS level topology using router level path traces was recently proposed in [8]. They report that their method resulted in an AS graph covering 62 of existing ASs (found in BGP routing tables) and about 61 of the ASlevel connectivity of those ASs. On the other hand, their approach detects parallel links, discovers ASs that are hidden in BGP routing tables due to AS ....

....hand, their approach detects parallel links, discovers ASs that are hidden in BGP routing tables due to AS aggregation, and identifies AS border routers. Since we are interested in using real AS graphs with maximum coverage and do not analyze the additional details revealed by the approach in [8], we found it more appropriate to use the AS level topologies obtained from BGP routing data as explained above. In order to compare properties of the AS graphs with graphs produced by a state of the art network topology generator, we selected Inet 2.1. For each of the AS graphs we generate an ....

[Article contains additional citation context not shown here]

H. Chang, S. Jamin, and W. Willinger, "Inferring AS-level Internet topology from router-level path traces," in Proceeding of SPIE ITCom 2001, Denver, CO, August 2001.

....UDP packets to a known destination and uses ICMP responses generated by intermediate routers to obtain the path between the source and the destination. In order to obtain comprehensive topology information, most existing systems run traceroute from multiple probing hosts [7] 8] 9] 10] [11] or use source routed traceroutes [12] 13] Two routers appearing consecutively on a path implies the existence of a link between them; this induces a natural construction of the underlying topology from the traceroute probe results. We have developed an IPv6 topology discovery tool, Atlas [13] ....

W. Willinger H. Chang, S. Jamin, "Inferring AS-Level Internet Topology from Router-Level Path Traces ," in Proceedings of SPIE International Symposium on Convergence of IT and Communication, August 2001.

No context found.

Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring ASlevel Internet topology from router-level path traces," in Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.

No context found.

Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring AS-level internet topology from router-level path traces," in Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.

No context found.

Hyunseok Chang, Sugih Jamin, and Walter Willinger, "Inferring ASlevel Internet topology from router-level path traces," in Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.

No context found.

Hyunseok Chang, Sugih Jamin, and Walter Willinger. Inferring AS-level internet topology 206 from router-level path traces. In Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM Conference, August 2001.

No context found.

H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001.

No context found.

H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001.

No context found.

H. Chang, S. Jamin, and W. Willinger, \Inferring AS-level Internet Topology from Router-Level Path Traces," in Proceedings of SPIE ITCom, (Denver, CO), August 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC