Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
Looking up data in P2P systems
Communications of the ACM
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
SIDnet-SWANS: a simulator and integrated development platform for sensor networks applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Social language network analysis
Proceedings of the 2010 ACM conference on Computer supported cooperative work
GTNA: a framework for the graph-theoretic network analysis
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Privacy-enhanced social-network routing
Computer Communications
PlanetSim: a new overlay network simulation framework
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Inferring who-is-who in the Twitter social network
Proceedings of the 2012 ACM workshop on Workshop on online social networks
| Hi-index | 0.00 |
Routing in complex networks is increasingly optimized towards situation and properties of the underlying network. Quick hypothesis testing with respect to the performance of different strategies, however, is posing to be an unnecessarily complicated task. To this end we propose GTNA-2, the enhanced second version of Graph-Theoretic Network Analyzer. Based on the broadly used GTNA, it allows both for the efficient and simple analysis of a large set of graph metrics, but additionally has been extended with support for rapid prototyping and quick evaluation of arbitrary routing algorithms. In this paper, we discuss the implementation and evaluation of routing algorithms in GTNA-2. As a proof of concept, we demonstrate the framework's ease of use by comparing the routing performance of Named data Networking with basic IP-based routing.