LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
JiST: an efficient approach to simulation using virtual machines: Research Articles
Software—Practice & Experience
MANET simulation studies: the incredibles
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
PlanetSim: a new overlay network simulation framework
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
GTNA 2.0 - a framework for rapid prototyping and evaluation of routing algorithms
Proceedings of the 2013 Summer Computer Simulation Conference
| Hi-index | 0.00 |
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific problem instance. The growing number of complex metrics that have been proposed in the last years, which mainly gain significance due to the increasing computational capabilities at hand, have led to important new insights in the field. However, they have solely been implemented as single algorithms, each specialized for the purpose of calculating exactly the targeted metric for a selected type of network graph. A comprehensive, extensible tool for the concise evaluation of graphs is currently not available. For this purpose we introduce the Graph-Theoretic Network Analyzer (GTNA), an efficient, Java-based toolkit for the comprehensive analysis of complex network graphs. GTNA, while already including the main metrics that are used to analyze the complex networks in computer science today, is simple to extend through a well defined plugin interface for metrics, network descriptions and network generator models. Throughout the paper we present the design and simple extensibility of GTNA, as well as the network models and metrics that are already implemented and give examples of its scalability and performance.