generate(self)
The process steps are the following: first we create the core network of tier one nodes, then we add the middle tier (M), the content provider (CP) and the customer (C) nodes along with their transit edges (link i,j means i is customer of j). Finally we add peering links between M nodes, between M and CP nodes and between CP node couples. For a detailed description of the algorithm, please refer to [1].
Generates a random AS network graph as described in [1].
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them