A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An Introduction to Copulas (Springer Series in Statistics)
An Introduction to Copulas (Springer Series in Statistics)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On the impact of route monitor selection
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Internet routing resilience to failures: analysis and implications
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Policy relationship annotations of predefined AS-level topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient algorithm for AS path inferring
Proceedings of the 2009 International Conference on Hybrid Information Technology
A stochastic clustering algorithm for swarm compact routing
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Obtaining provably legitimate internet topologies
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocols. Despite the volume of research in this area the last several years, current topology generators fail to capture an inherent aspect of the autonomous-system (AS) topology of the Internet, namely the fact that AS links reflect business agreements between competing entities, which impose restrictions on how traffic is routed between ASs. These restrictions result in inflated AS paths and generally in suboptimal routing in the Internet. In this work, we first evaluate the importance of modeling AS relationships when conducting accurate and realistic simulation studies. We demonstrate that ignoring AS relationships produces different simulation results than modeling AS relationships based on known relationships between Internet Internet Service Providers (ISPs). Then, we introduce a framework for generating synthetic AS topologies annotated with realistic relationships. In addition to modeling the degree distribution of a network, which is the property that most existing topology generators model, our framework also models new properties that capture the characteristics of AS relationships. Finally, we propose a novel algorithm for generating synthetic graphs, annotated with AS relationships, that reproduce these AS relationships-aware propertie