A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Towards capturing representative AS-level Internet topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
On the power-law random graph model of massive data networks
Performance Evaluation - Internet performance symposium (IPS 2002)
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
BASE: an incrementally deployable mechanism for viable IP spoofing prevention
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Empirical study of tolerating denial-of-service attacks with a proxy network
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
An integrated model of traffic, geography and economy in the internet
ACM SIGCOMM Computer Communication Review
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Metropolitan fiber optical network planning model based on self organizing neural networks
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
Assessing the vulnerability of the fiber infrastructure to disasters
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The goal of this work is to model the peering arrangements between Autonomous Systems (ASes). Most existing models of the AS-graph assume an undirected graph. However, peering arrangements are mostly asymmetric customer-provider arrangements, which are better modeled as directed edges. Furthermore, it is well known that the AS-graph, and in particular its clustering structure, is influenced by geography. We introduce a new model that describes the AS-graph as a directed graph, with an edge going from the customer to the provider, but also models symmetric peer-to-peer arrangements, and takes geography into account. We are able to mathematically analyze its power-law exponent and number of leaves. Beyond the analysis, we have implemented our model as a synthetic network generator we call GdTang. Experimentation with GdTang shows that the networks it produces are more realistic than those generated by other network generators, in terms of its power-law exponent, fractions of customer-provider and symmetric peering arrangements, and the size of its dense core. We believe that our model is the first to manifest realistic regional dense cores that have a clear geographic flavor. Our synthetic networks also exhibit path inflation effects that are similar to those observed in the real AS graph.