(Technique1): Use network domain and routing data
to construct a spanning tree for a directed graph.
Rely on the property exhibited in a hyperbolic sphere or hemisphere
where the area represented increases exponentially as the
radius increases. Then, even when there are hundreds of
thousands of nodes, a large portion of the directed graph
a central node focal point while all other nodes are compressed at the
edges to provide context (like a fish-eye lens). Achieve this focus by
using a simple, optimized cone tree layout algorithm for hyperbolic space
where children are layed out in
concentric bands on the surface of a calculated hemispheric cap on the cone.
Key Visualization Mappings:
(Mapping1): Outgoing links are reddish.
(Mapping2): Incoming links are blue.
(Mapping3): Router nodes are colored yellow. Directly connected
hosts are green, and indirectly connected hosts are red.
(Mapping4): Nodes and links to the right of the graph are parents. Nodes and links to the left are children.
(Mapping5): Nodes may be labeled with their IP address.
(Tool1) hypviewer by Tamara Munzner
(Tool2) skitter data conversion by Daniel McRobb.