A new systematic analysis and generation technique for the Internet topology

摘要

The dK-series analysis is an efficient technique to analyze properties of the Internet topology. Increasing values of d capture progressively more properties of the original topology at the cost of more complex states. In this paper, we present a new systematic analysis and generation technique based on the adjacency graph distribution, called dM-series analysis technique. The dM-series has less states and easier generation algorithm compared with dK-series, so it is more practical when analyzing large scale networks like the Internet AS-level topology. Experimental results show that the generated dM graphs converge to the original graph faster than the generated dK graphs when d increases.