The contents of this legacy page are no longer maintained nor supported, and are made available only for historical purposes.

Hyperbolic Graph Generator

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.

Download

Download Hyperbolic Graph Generator v1.0.1. The latest revisions are also on GitHub as well.

Information

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/

Related Objects

See https://catalog.caida.org/details/software/hyperbolic_graph_generator/ to explore related objects to this document in the CAIDA Resource Catalog.
Published
Last Modified