Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Realistic Modeling and Svnthesis of Resources for Computational Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Understanding internet topology: principles, models, and validation
IEEE/ACM Transactions on Networking (TON)
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Measurement based analysis, modeling, and synthesis of the internet delay space
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Orbis: rescaling degree correlations to generate annotated internet topologies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Communications Magazine
The HyperVerse: concepts for a federated and Torrent-based '3D Web'
International Journal of Advanced Media and Communication
Self-organizing collaborative filtering in global-scale massive multi-user virtual environments
Proceedings of the 2009 ACM symposium on Applied Computing
Avatar mobility in user-created networked virtual worlds: measurements, analysis, and implications
Multimedia Tools and Applications
HyperVerse: simulation and testbed reconciled
International Journal of Advanced Media and Communication
FloRA: flock-based resource allocation for decentralized distributed virtual environments
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
In order to realistically simulate algorithms or evaluate P2P overlay topologies, a detailed model of the underlying router topology is required. Since actively measuring this topology is extremely laborious and furthermore a waste of network resources, traditionally topology generators are used in order to create synthetic router-level graphs. For this, usually graph models are selected that are known to generate graphs which are similar to the actual Internet in respect to a certain metric like e.g. vertex degree distribution. These models are often superseded or adjusted when new metrics are being introduced which better differentiate between graphs. Furthermore it has been shown, that graphs that are similar in respect to e.g. vertex degree distribution can be very different from a structural point of view. In this paper Top-Gen, a generic, extensible and easy-to-use topology generation platform is presented. It contains a topology generation module which bases the generation of router-level graphs on the Internet's underlying principles and the technological constraints of routers rather than trying to effectuate similarity in respect to a certain metric. Apart from describing TopGen's general topology generation approach, graphs created with its Internet topology module are evaluated and found to be encouragingly similar to real-world datasets in various respects.