Example: 'CAC algorithm based on shortest path routing'

Brief description

Basic CAC algorithm which tries to route each connection request in the shortest path. Since it is an uncapacitated algorithm, links may become over-subscribed

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 2013
CodeCACSim_AA_basicAlgorithm.java

Detailed description

Upon connection request, it tries to route the connection by the shortest path. If a path could be found, then the connection is routed over it. Otherwise, it is blocked. It is worth noting that links may become over-subscribed.

Upon connection release no further action is made.