Figure 6: Greedy forwarding in the mapped Internet. | Nature Communications

Figure 6: Greedy forwarding in the mapped Internet.

From: Sustaining the Internet with hyperbolic mapping

Figure 6

Greedy forwarding performs almost optimally in the mapped Internet, as indicated by the success ratio, ps, and average stretch, , after removal of a given fraction of AS nodes (panel a) or links (panel b). Bottom plots show these two metrics after removing a number of the highest-degree nodes (panel c), and a fraction of links among highest-degree nodes (panel d). The links are first ranked by the product of node degrees that they connect, and then a fraction of top-ranked links are removed. The giant connected component is still present after all removals, but it drops to 85% of the original graph after the removal of 10 hubs.

Back to article page