Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
File system usage in Windows NT 4.0
Proceedings of the seventeenth ACM symposium on Operating systems principles
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Toward an optimization-driven framework for designing and generating realistic Internet topologies
ACM SIGCOMM Computer Communication Review
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Internet connectivity at the AS-level: an optimization-driven modeling approach
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
On the emergence of highly variable distributions in the autonomous system topology
ACM SIGCOMM Computer Communication Review
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Efficient algorithms for large-scale topology discovery
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Small-world characteristics of internet topologies and implications on multicast scaling
Computer Networks: The International Journal of Computer and Telecommunications Networking
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Orbis: rescaling degree correlations to generate annotated internet topologies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Automatic induction of inter-domain hierarchy in randomly generated network topologies
SpringSim '07 Proceedings of the 2007 spring simulaiton multiconference - Volume 1
Ten years in the evolution of the internet ecosystem
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Internet core topology mapping and analysis
Computer Communications
Small-world characteristics of Internet topologies and implications on multicast scaling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Estimating AS relationships for application-layer traffic optimization
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
Toward topology dualism: improving the accuracy of AS annotations for routers
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Impact of random failures and attacks on Poisson and power-law random networks
ACM Computing Surveys (CSUR)
On name-based inter-domain routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Twelve years in the evolution of the internet ecosystem
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In a recent and much celebrated paper, Faloutsos et al. [6] found that the inter Autonomous System (AS) topology exhibits a power-law degree distribution. This result was quite unexpected in the networking community, and stirred significant interest in exploring the possible causes of this phenomenon. The work of Barabasi et al. [2], and its application to network topology generation in the work of Medina et al. [9], have explored a promising class of models that yield strict power-law degree distributions. These models, which we will refer to collectively as the B-A model, describe the detailed dynamics of the network growth process, modeling the way in which connections are made between ASs. There are two simple connectivity rules that define the evolution of AS connectivity over time: incremental growth where a new AS connects to existing ASs, and preferential connectivity where the likelihood of connecting to an AS is proportional to the vertex outdegree of the target AS. These simple rules, which are similar to the classical "rich get richer" model originally proposed by Simon [12], lead to power-law degree distributions. While the B-A model provably yields power-law vertex degree distributions, recent empirical evidence indicates that the model may not be consistent with the dynamics underlying the evolution of the actual AS topology. First, there is strong evidence [3, 4] that the degree distribution of the actual AS topology does not conform to a strict power law. However, the distribution is certainly heavy-tailed or highly-variable in the sense that the observed vertex degrees typically range over three or four orders of magnitude; in some cases, the tail of the degree distribution may fit a power law. These observations were gleaned from more complete pictures of AS - level connectivity (obtained by augmenting BGP route tables with peering relationships from other sources) than those used by earlier work [2, 6, 9]. Second, the B-A model's AS connectivity evolution rules can be shown to be inconsistent with empirical AS growth measurements [16]. As such, while the B-A model appears to produce topologies whose degree distribution characteristics exhibit power-law behavior, it cannot be a valid explanation for the connectivity evolution in the AS topology. Clearly, some of these empirical observations don't corroborate the claim that the B-A model explains the phenomenon of highly variable vertex degrees in the Internet's AS topology [2]. However, the B-A model was originally proposed as a simple illustration of how some elementary mechanisms or rules can give rise to power law vertex degree distributions. As such, it is likely that the B-A model can be modified to accommodate these more recent findings [1], but we will neither discuss here such modifications nor comment on their possibility for success. Instead, we merely note that any such resulting model would seek, as does the original B-A model, to explain the highly variable degree distribution of the AS topology through the detailed dynamics of how connections between ASs are established. The purpose of this note is to raise the question --- motivated by the B-A approach---of whether the underlying cause of the high variability phenomenon of the vertex degree distribution lies in the detailed dynamics of network growth, or if there are alternative explanations. To that end, we briefly outline an alternative explanation for the AS topology degree distribution. We do not claim to have proven that this explanation holds; our purpose here is merely to expand the dialog to a larger class of explanations for the variability of the AS topology degree distribution.