R. Govinda and H. Tangmunarunkit. Heuristics for internet map discovery. In Proceedings of IEEE INFOCOM '2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to find the IP address to hop count mapping, without compromising end hosts, is to figure out the locations of IP addresses, an accurate router level topology of the Internet, and the underlying routing algorithms and policies. The recent Internet mapping efforts such as Internet Map [7] Mercator [18], Rocketfuel [38] and Skitter [8] projects, may make the approach plausible. However, the current topology mappings put together snap shots of portions of networks measured at different times. Topology maps thusproduced are generally time averaged approximation of network connectivity. Moreover, ....

R. Govinda and H. Tangmunarunkit. Heuristics for internet map discovery. In Proceedings of IEEE INFOCOM '2000.

....the inter domain level, an AS graph is generated to model the Internet topology [15] 3] 11] 10] 8] In an AS graph, a node represents a single domain (AS) and an edge represents an inter domain connection. At the router level, a node in the router graph represents a router [13] 1] 2] [5], 15] and an edge represents the adjacency of two routers. Approaches to generating AS graphs can be grouped into three categories: AS Path based graph, traceroute based graph, and synthetic graph. A. AS Path based AS graph The AS graph is derived from the AS Path information in BGP Update ....

R. Govinda and H. Tangmunarunkit. Heuristics for Internet map discovery. In Proceedings of IEEE Infocom, April 2000.

....the inter domain level, an AS graph is generated to model the Internet topology [15] 3] 11] 10] 8] In an AS graph, a node represents a single domain (AS) and an edge represents an inter domain connection. At the router level, a node in the router graph represents a router [13] 1] 2] [5], 15] and an edge represents the adjacency of two routers. Approaches to generating AS graphs can be grouped into three categories: 1. AS Path based AS graph. The AS graph 2 is derived from the AS Path information in BGP Update messages [6] or in BGP tables [14] Each element of an AS Path ....

R. Govinda and H. Tangmunarunkit. Heuristics for Internet map discovery. In Proceedings of IEEE Infocom, April 2000.

No context found.

R. Govinda and H. Tangmunarunkit. Heuristics for internet map discovery. In Proceedings of IEEE INFOCOM '2000.

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