Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., and Willinger, W., "Network topologies, power laws and hierarchy," TR01-746, USC, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a source to a destination host at the IP level. The traceroute data must be analyzed to infer which interfaces belong to the same router and which routers belong to the same AS [6] Running experiments between multiple source destination pairs provides a larger collection of paths over time [6] [7], 8] Other studies have extracted AS paths directly from BGP routing tables or BGP update messages [9] 10] The routing table dump from the University of Oregon RouteViews server [11] 12] has been the basis of several studies of basic topological properties, such as the distribution of node ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws, and hierarchy," Tech. Rep. 01-746, Computer Science, University of Southern California, June 2001.

....a source to a destination host at the IP level. The traceroute data must be analyzed to infer which interfaces belong to the same router and which routers belong to the same AS [6] Running experiments between multiple source destination pairs provides a larger collection of paths over time [6] [7], 8] Other studies have extracted AS paths directly from BGP routing tables or BGP update messages [9] 10] The routing table dump from the University of Oregon RouteViews server [11] 12] has been the basis of several studies of basic topological properties, such as the distribution of node ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws, and hierarchy," Tech. Rep. 01-746, Computer Science, University of Southern California, June 2001.

....benefit from topology generators that can produce Internet like topologies. Many topology generators have been proposed for modeling Internet. They fall into one of three classes, random graph generators, structural generators, and degree power law generators. It has been demonstrated in [17] [21] that the topology produced by power law topology generators resembles the ASlevel Internet topology better than those produced by random graph generators or structural generators. In this paper, we investigate the effectiveness of several recently developed power law topology generators, 5] 6] ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger "Network Topologies, Power Laws, and Hierarchy." Technical Report 01-746, Computer Science Department, University of Southern California.

....a source to a destination host at the IP level. The traceroute data must be analyzed to infer which interfaces belong to the same router and which routers belong to the same AS [6] Running experiments between multiple source destination pairs provides a larger collection of paths over time [6] [7], 8] Other studies have extracted AS paths directly from BGP routing tables or BGP update messages [9] 10] The routing table dump from the University of Oregon RouteViews server [11] 12] has been the basis of several studies of basic topological properties, such as the distribution of node ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws, and hierarchy," Tech. Rep. 01-746, Computer Science Department, University of Southern California, 2001.

....benefit from topology generators that can produce Internet like topologies. Many topology generators have been proposed for modeling Internet. They fall into one of three classes, random graph generators, structural generators, and degree power law generators. It has been demonstrated in [15] [19] that the topology produced by power law topology generators This work was supported in part by DARPA under contract F3060200 2 0554, by National Science Foundation under Grant No. CDA9502639, EIA0080119. resembles the AS level Internet topology better than those produced by random graph ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger "Network Topologies, Power Laws, and Hierarchy." Technical Report 01-746, Computer Science Department, University of Southern California.

....ability to generate the power law relationships observed in real AS graphs, our results allows us to combine structure and power laws into a single model. Our work on the analysis of AS level topology graphs complements research carried out at various research labs worldwide, e.g. 5] 4] 6] [13]. In particular, we think that our proposal to consider the normalized Laplacian spectrum as a topology fingerprint will be useful in detecting the similarity and or differences of graphs obtained from various sources, even beyond the domain of communication networks. Note that some previous ....

.... one of the standard metrics used in the comparison of network topology graphs, in addition to standard graph parameters like diameter, average degree, and average path length, power law relationships as those observed in [5] and routing related metrics like expansion, resilience and distortion [13]. B. Future Work Our results provide several immediate starting points for future work. First of all, we intend to use the insights we obtained from our analysis for improving the quality of the Inet 2.1 generator (with respect to the similarity to real AS graphs) and to explore the potential of ....

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws, and hierarchy," Tech. Rep. 01-746, Computer Science Department, University of Southern California, June 2001.

No context found.

Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., and Willinger, W., "Network topologies, power laws and hierarchy," TR01-746, USC, 2001.

No context found.

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws and hierarchy," Tech. Rep. TR01-746, Technical Report, University of Southern California, 2001.

....latencies of 20ms for intra transit domain links, 5ms for stub transit links and 2ms for intra stub domain links (we also experimented with a delay distribution of 100, 10 and 1ms instead of 20, 5 and 2ms respectively with no real change in our results) 2. PLRG1 and PLRG2: Recent studies [20] [21] have indicated that the Internet s degree distribution follows a power law. Motivated by these observations, degree based generators have been proposed [22] which appear to better model the measured Internet topology. We make use of the same power law random graph generator as used by [21] 22] ....

....[20] 21] have indicated that the Internet s degree distribution follows a power law. Motivated by these observations, degree based generators have been proposed [22] which appear to better model the measured Internet topology. We make use of the same power law random graph generator as used by [21], 22] PLRG1 and PLRG2 are Power Law Random Graphs with 1,166 and 1,779 nodes respectively. To each link in the topology, we assign a random delay between 5 and 100ms. 3. NLANR: The Active Measurement Project (AMP) at the National Laboratory for Applied Network Research (NLANR) uses a ....

[Article contains additional citation context not shown here]

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topologies, power laws and hierarchy," Tech. Rep. TR01-746, Technical Report, University of Southern California, 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