@TECHREPORT{Winick02inet-3.0:internet, author = {Jared Winick and Sugih Jamin}, title = {Inet-3.0: Internet topology generator}, institution = {}, year = {2002} }

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract In this report we present version 3.0 of Inet, an Autonomous System (AS) level Internet topologygenerator. Our understanding of the Internet topology is quickly evolving, and thus, our understanding of how synthetic topologies should be generated is changing too. We document our analysis of Inet-2.2, which highlighted two shortcomings in its topologies. Inet-3.0 improves upon Inet-2.2's two main weaknesses by creating topologies with more accurate degree distributions and minimum vertexcovers as compared to Internet topologies. We also examine numerous other metrics to show that Inet3.0 better approximates the actual Internet AS topology than does Inet-2.2. Inet-3.0's topologies stilldo not well represent the Internet in terms of maximum clique size and clustering coefficient. These related problems stress a need for a better understanding of Internet connectivity and will be addressedin future work.

...e paths between all pairs of nodes in the topology. Fig. 20shows that Inet-2.2, Inet-3.0, and Internet topologies all show similar resilience. Normalized Laplacian spectrum of a graph. It is shown in =-=[13]-=- that the normalized laplacian spectrum( nls) is a much more discriminating and descriptive metric than the largest eigenvalues of the ad-jacency matrix of a graph. Coming from the field of spectral g...

... maximum cliquesize of a graph is just the size of the largest clique in the graph. Finding the maximum clique in a graph is an NP-hard problem, but there are many well-known approximation algorithms =-=[10]-=-.Fig. 24 highlights the most significant known deficiency with Inet-3.0 topologies. The maximum clique size in Inet-3.0 is consistently about half as large as the maximum clique size of the Internet.I...

... Top 3 nodes do not fitpower law 0.0001 0.001 0.01 0.1 1 1 10 100 1000 1 - CDF(Outdegree) Outdegree InternetInet-2.2 Figure 2: _F (d) with top 3 nodes excluded. This power law has been used by others =-=[1, 2]-=-, as it describes the degrees of all but about the top 3 nodesas seen in Fig. 1. Fig. 2 shows _F (d) for the Internet topology in February 2001, along with an equal sized Inet-2.2 topology.While we se...

... Top 3 nodes do not fitpower law 0.0001 0.001 0.01 0.1 1 1 10 100 1000 1 - CDF(Outdegree) Outdegree InternetInet-2.2 Figure 2: _F (d) with top 3 nodes excluded. This power law has been used by others =-=[1, 2]-=-, as it describes the degrees of all but about the top 3 nodesas seen in Fig. 1. Fig. 2 shows _F (d) for the Internet topology in February 2001, along with an equal sized Inet-2.2 topology.While we se...