Router Waxman

RouterWaxman basically refers to a generation model for a random topology using Waxman's probability model for interconnecting the nodes of the topology, which is given by:

$$P(u,v) = \alpha\; e^{-d/ (\beta L)}$$ (1)

where $0 < \alpha, \beta \leq 1$, $d$ is the Euclidean distance from node $u$ to node $v$, and $L$ is the maximum distance between any two nodes.

RouterWaxman only differs from the ASWaxman model in that the nodes of a RouterWaxman topology represent routers rather than ASs.