GTNA is a Java-based framework that allows for the graph-theoretic analysis of arbitrary network topologies. Snapshots can by imported from network simulators in various formats. Also, they may be generated using network topology generators implemented in the GTNA framework. GTNA is easily extendible through a well-defined plugin interface. New metrics as well as network topology generators can be implemented with very little effort. We already provide a large set of commonly used graph metrics that are implemented in GTNA. This contains metrics such as the computation of shortest path lengths, different degree distributions, clustering coefficient, network fragmentation as well as the rich-club connectivity. A large set of topology generators has also been implemented, including canonical networks, common networks models and peer-to-peer networks. We are currently implementing additional metrics like the motif recognition as well as the identification of role-to-role connectivity profiles. We are also planning to include realistic Internet topology generators such as the Positive-Feedback Preference model (PFP) and the Parallel Addition and Requiring Growth model (PARG). Furthermore, we intend to extend the general generation process to allow for a more dynamic topology creation to gain deeper insights into the development of networks during their development.

License

GTNA is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

GTNA is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.