Oliver Heckmann
ABSTRACT
Simulations are an important tool in network research. As the selected topology often influences the outcome of the simulation, realistic topologies are needed to produce realistic simulation results. We first discuss the different types of topologies and present our collection of real-world topologies that can be used for simulation. We then define several similarity metrics to compare artificially generated topologies with real world topologies. We use them to find out what the input parameter range of the topology generators of BRITE, TIERS and GTITM are to create realistic topologies. These parameters can act as a valuable starting point for researchers that have to generate artificial topologies.
- M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-law Relationships of the Internet Topology. In Proceedings of SIGCOMM 1999, pages 251--262. IEEE, 1999. Google Scholar
Digital Library
- A. Medina, I. Matta, and J. Byers. On the Origin of Power Laws in Internet Topologies. Computer Communications Review, April 2000. http://www.cs.bu.edu/brite/publications/ccr00.pdf. Google ScholarDigital Library
- Q. Chen, H, Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The Origin of Power Laws in Internet Topologies Revisited. In IEEE Infocom 2002. IEEE, 2002.Google Scholar
- H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Wollinger. Network Topologies, Power Laws, and Hierarchy. Technical Report Technical Report USC-CS-01-746, University of Michigan, USA, 6 2001.Google Scholar
- T. Bu and D. Towsley. On Distinguishing between Internet Power Law Topology Generators. In INFOCOM '2002. IEEE, 2002.Google Scholar
- W. Aiello, F. Chung, and L. Lu. A Random Graph Model for Power Law Graphs. Experimental Mathematics Volume 10, pages 53--66, 2001.Google Scholar
- E. W. Zegura, K. Calvert, and M. J. Donahoo. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, December 1997. Google ScholarDigital Library
- C. R. Palmer and J. G. Steffan. Generating network topologies that obey power laws. In GLOBECOM '2000, November 2000.Google ScholarCross Ref
- N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP Topologies with Rocketfuel. In SIGCOMM '2002. ACM, 2002. Google ScholarDigital Library
- BRITE. Boston University Representative Internet Topology Generator. http://www.cs.bu.edu/brite/.Google Scholar
- TIERS. Tiers Topology Generator. http://www.isi.edu/nsnam/ns/ns-topogen.html#tiers.Google Scholar
- GT-ITM. Georgia Tech Internetwork Topology Models. http://www.cc.gatech.edu/projects/gtitm/.Google Scholar
- Inet Topology Generator. http://topology.eecs.umich.edu/inet/.Google Scholar
- A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, October 1999.Google Scholar
- R. Hooke and T. A. Jeeves. Direct search solution of numerical and statistical problems. Journal of the Association for Computer Machinery, pages 212--229, 8 1961. Google ScholarDigital Library
- O. Heckmann, K. Pandit, J. Schmitt, M. Hoffmann, and M. Jobmann. LETSQoS Milestone 2. http://www.letsqos.de, June 2002.Google Scholar
Recommendations
NPART - node placement algorithm for realistic topologies in wireless multihop network simulation
Simutools '09: Proceedings of the 2nd International Conference on Simulation Tools and TechniquesDespite a considerable number of topology generation algorithms for simulation of wireless multihop networks it is difficult to find one with output similar to real networks.
We propose NPART --- a Node Placement Algorithm for Realistic Topologies whose ...
Designing optimal iBGP route-reflection topologies
NETWORKING'08: Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internetThe Border Gateway Protocol (BGP) is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a full-mesh of iBGP sessions between routers is not ...
Routing in intermittent network topologies
MSWiM '06: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systemsThe topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main objective in designing routing algorithms is to minimize the delay and ...
Comments