Example: 'CAC algorithm based on capacitated shortest path routing'

Brief description

CAC algorithm which tries to route each connection request in the shortest path for which there is enough bandwidth. If no route satisfies this, the connection is blocked

Algorithm description table

Algorithm inputs

Inputs to this CAC algorithm are connection request and release events. For every new connection request, the algorithm tries to routing over the shortest path.

Algorithm parameters:

  • shortestPathType: Each demand is routed according to the shortest path according to this type ('km' or 'hops'). Default: "hops"
Algorithm outputsAccept or block decision for new connection requests. No action for connection releases. Existing connections are not modified.
Required librariesNone
KeywordsNone
AuthorsPablo Pavón Mariño, José Luis Izquierdo Zaragoza
DateMarch 2014
CodeCACSim_AA_capacitatedSP.java

Detailed description

In contrast to the uncapacitated version, this algorithm tries to search for the shortest path among those which have, at least, the required capacity of the new connection. If there is path, then it is accepted. Otherwise, it is blocked