random_internet_as_graph(n, seed=None)
This algorithm returns an undirected graph resembling the Internet Autonomous System (AS) network, it uses the approach by Elmokashfi et al. and it grants the properties described in the related paper .
Each node models an autonomous system, with an attribute 'type' specifying its kind; tier-1 (T), mid-level (M), customer (C) or content-provider (CP). Each edge models an ADV communication link (hence, bidirectional) with attributes:
type: transit|peer, the kind of commercial agreement between nodes;
customer: <node id>, the identifier of the node acting as customer ('none' if type is peer).
Number of graph nodes
Indicator of random number generation state. See Randomness<randomness>
.
A randomly generated undirected graph
Generates a random undirected graph resembling the Internet AS network
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