Example: 'Waxman generator'

Brief description

Generates a topology using the Waxman random model

Algorithm description table

Algorithm inputs

Doesn't require any information within the netPlan object.

Algorithm parameters:

  • N: Number of nodes. Default: 30
  • alpha: 'alpha' factor. Default: 0.4
  • beta: 'beta' factor. Default: 0.4
  • xmax: Right endpoint for the x-axis. Default: 100
  • xmin: Left endpoint for the x-axis. Default: 0
  • ymax: Upper endpoint for the y-axis. Default: 100
  • ymin: Lower endpoint for the y-axis. Default: 0
  • linkCapacities: The capacities to set in the links. Default: 100
Algorithm outputsA complete topology (nodes and links)
Required librariesNone
KeywordsCapacity assignment (CA), Topology assignment (TA)
AuthorsPablo Pavón Mariño, José Luis Izquierdo Zaragoza
DateMarch 2013
CodeTCA_WaxmanGenerator.java

Detailed description

The Waxman's generator is a geographic model for the growth of a network. In this model nodes are uniformly distributed in a given area and links are added according to probabilities that depend on the distances between the nodes. The probability to have a link between nodes \(i\) and \(j\) is given by:

\(P(i,j)=\alpha*\exp{-d/[\beta*d_{max}]}\)

where \(0<\alpha\), \(\beta\geq 1\), \(d\) is the distance from \(i\) to \(j\), and \(d_{max}\) is the maximum distance between any node pair. An increase in the parameter \(\alpha\) increases the probability of edges between any nodes in the network, while an increase in \(\beta\) yields a larger ratio of long links to short links.

[1] B.M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617-1622, December 1988