#1
30th April 2015, 01:17 PM
| |||
| |||
GT-ITM Topology Generator
How many number of Network topology generator are available in Georgia Tech Internetwork Topology Models (GT-ITM), how can I get that detailed information & will you please provide information about GTITM Network topology generator???
|
#2
12th May 2018, 08:24 AM
| |||
| |||
Re: GT-ITM Topology Generator
Hello sir, is there any one can suggest me books for to understand the GT-ITM Topology Generator? Which books are available for GT-ITM Topology Generator?
|
#3
12th May 2018, 08:26 AM
| |||
| |||
Re: GT-ITM Topology Generator
The GT-ITM is a collection of software tools for creation, manipulation, and analysis of graph models of internet topology. It has been used by networking researchers in a variety of ways, most often to create topologies for use in simulation studies The GT-ITM topology generator can be used to create flat random graphs and two types of hierarchical graphs, the N-level and transit-stub. Need to create a transit-stub graph with 200 nodes. Here is PDF for Information for GT-ITM Topology Generator: Overview Of Gt-ITM: The original GT-ITM comprises: A command-line program that controls the creation of random graphs according to various models (including the transitstub model) and parameters. A command-line program that controls the evaluation of various characteristics of graphs, e.g. diameter. Various example graphs and parameter files for creating them. Publications: Megan Thomas and Ellen W. Zegura. "Generation and Analysis of Random Graphs to Model Internetworks." Technical Report GIT-CC-94-46, College of Computing, Georgia Tech. Ellen W. Zegura, Ken Calvert and S. Bhattacharjee. How to Model an Internetwork. Proceedings of IEEE Infocom '96, San Francisco, CA. Ken Calvert, Matt Doar and Ellen W. Zegura. Modeling Internet Topology. IEEE Communications Magazine, June 1997. Ellen W. Zegura, Kenneth Calvert and M. Jeff Donahoo. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, December 1997. |
|