11,816 research outputs found

    Accurately modeling the Internet topology

    Get PDF
    Based on measurements of the Internet topology data, we found out that there are two mechanisms which are necessary for the correct modeling of the Internet topology at the Autonomous Systems (AS) level: the Interactive Growth of new nodes and new internal links, and a nonlinear preferential attachment, where the preference probability is described by a positive-feedback mechanism. Based on the above mechanisms, we introduce the Positive-Feedback Preference (PFP) model which accurately reproduces many topological properties of the AS-level Internet, including: degree distribution, rich-club connectivity, the maximum degree, shortest path length, short cycles, disassortative mixing and betweenness centrality. The PFP model is a phenomenological model which provides a novel insight into the evolutionary dynamics of real complex networks.Comment: 20 pages and 17 figure

    Chinese Internet AS-level Topology

    Full text link
    We present the first complete measurement of the Chinese Internet topology at the autonomous systems (AS) level based on traceroute data probed from servers of major ISPs in mainland China. We show that both the Chinese Internet AS graph and the global Internet AS graph can be accurately reproduced by the Positive-Feedback Preference (PFP) model with the same parameters. This result suggests that the Chinese Internet preserves well the topological characteristics of the global Internet. This is the first demonstration of the Internet's topological fractality, or self-similarity, performed at the level of topology evolution modeling.Comment: This paper is a preprint of a paper submitted to IEE Proceedings on Communications and is subject to Institution of Engineering and Technology Copyright. If accepted, the copy of record will be available at IET Digital Librar

    Understanding the internet topology evolution dynamics

    Get PDF
    The internet structure is extremely complex. The Positive-Feedback Preference (PFP) model is a recently introduced internet topology generator. The model uses two generic algorithms to replicate the evolution dynamics observed on the internet historic data. The phenomenological model was originally designed to match only two topology properties of the internet, i.e. the rich-club connectivity and the exact form of degree distribution. Whereas numerical evaluation has shown that the PFP model accurately reproduces a large set of other nontrivial characteristics as well. This paper aims to investigate why and how this generative model captures so many diverse properties of the internet. Based on comprehensive simulation results, the paper presents a detailed analysis on the exact origin of each of the topology properties produced by the model. This work reveals how network evolution mechanisms control the obtained topology properties and it also provides insights on correlations between various structural characteristics of complex networks.Comment: 15 figure

    A critical look at power law modelling of the Internet

    Get PDF
    This paper takes a critical look at the usefulness of power law models of the Internet. The twin focuses of the paper are Internet traffic and topology generation. The aim of the paper is twofold. Firstly it summarises the state of the art in power law modelling particularly giving attention to existing open research questions. Secondly it provides insight into the failings of such models and where progress needs to be made for power law research to feed through to actual improvements in network performance.Comment: To appear Computer Communication

    Modeling the IPv6 Internet AS-level Topology

    Full text link
    To measure the IPv6 internet AS-level topology, a network topology discovery system, called Dolphin, was developed. By comparing the measurement result of Dolphin with that of CAIDA's Scamper, it was found that the IPv6 Internet at AS level, similar to other complex networks, is also scale-free but the exponent of its degree distribution is 1.2, which is much smaller than that of the IPv4 Internet and most other scale-free networks. In order to explain this feature of IPv6 Internet we argue that the degree exponent is a measure of uniformity of the degree distribution. Then, for the purpose on modeling the networks, we propose a new model based on the two major factors affecting the exponent of the EBA model. It breaks the lower bound of degree exponent which is 2 for most models. To verify the validity of this model, both theoretical and experimental analyses have been carried out. Finally, we demonstrate how this model can be successfully used to reproduce the topology of the IPv6 Internet.Comment: 15 pages, 5 figure
    corecore