The Hyperbolic-Graph-Generator (hg_graph) is a package of tools to generate graphs embedded in the hyperbolic plane, and to compute the efficiency of greedy forwarding in these graphs.
This standalone package is also a core component of the hyperbolic routing package that is going to be integrated into the NDNSim. Hyperbolic routing is greedy geometric routing in a hyperbolically embedded network. Hyperbolic routing has attractive scalability and efficiency characteristics. In particular, applied to the AS Internet, hyperbolic routing is nearly optimal, i.e., maximally scalable (http://dx.doi.org/10.1038/ncomms1063). The NDN testbed has been recently mapped to the hyperbolic plane yielding similar routing efficiency (https://www.caida.org/research/routing/greedy_forwarding_ndn/). Because of its exceptional scalability and efficiency characteristics, hyperbolic routing is one of the routing strategies in the NDN architecture.
Written by Chiara Orsini. More information is available at http://named-data.github.io/Hyperbolic-Graph-Generator/