Each graph is generated using the NDN testbed nodes, with the hyperbolic coordinates of the involved ASs given in Supplementary Information of this paper. (REMAP is omitted because its coordinates are identical to those of UCLA.)

Each node is linked to the m nodes closest to it according to their hyperbolic coordinates.

For each m, we calculate statistics for forwarding between every pair of nodes in the full graph, and also for modified versions of the graph with every 1-link removal and every 1-node removal.

Each experiment has three files associated with it:

• nodes describes the nodes and their polar coordinates in the hyperbolic plane. The format is self-documenting.
• links lists each link as a pair of AS numbers.
• paths files contain the forwarding paths between all source-destination pairs. Each line represents one path between a source-destination pair, and has the format:
  
  AS₁ AS₂ AS₃ ... AS_N-1 AS_N outcome
  
  AS₁ is the source and AS_N is the destination. AS₂ ... AS_N-1 are other hops along the path; each is preceeded with a "-" or "+" if the distance to the destination decreased or increased, compared to the previous hop. Outcome is either "s" for success, or "f" for failure. If outcome is "f", then AS_N-1 is the hop at which the forwarding algorithm gave up.