Example: 'Find link capacities to allocate shortest path (uncapacitated) routing'

Brief description

Given a network topology, and the offered traffic, this algorithm first routes the traffic according to the shortest path (in number of traversed links or in number of traversed km), and then fixes the capacities so that the utilization in all the links is equal to a user-defined given value

Algorithm description table

Algorithm inputs

Requires a topology (nodes and links) and a demand set within the netPlan object.

Algorithm parameters:

  • cg: Fixed link utilization. Default: 0.6
  • shortestPathType: Criteria to compute the shortest path. Valid values: 'hops' or 'km'. Default: "hops"
Algorithm outputsLink capacities and traffic routing updated within the netPlan object.
Required librariesNone
KeywordsCapacity assignment (CA), Flow assignment (FA)
AuthorsPablo Pavón Mariño, José Luis Izquierdo Zaragoza
DateMarch 2013
CodeCFA_shortestPathFixedUtilization.java