Examples involving 'Protection algorithm'

Maximum idle bottleneck capacity routing, flow-link formulation, and link-disjoint backup path protection

Keywords: Flow assignment (FA), JOM, MILP formulation, Protection algorithm

Given a network topology, the capacities in the links and the offered traffic, this algorithm obtains a link-disjoint or a SRG-disjoint (depending on user's choice) primary and backup path for the traffic of each demand, that minimizes the network congestion, with the constraint of non-bifurcated routing. For that it solves an ILP flow-link formulation (more complex in the SRG-disjoint case). In this algorithm, congestion is minimized by maximizing the idle link capacity in the bottleneck (the link with less idle capacity).

Shortest path (uncapacitated) routing, and link-disjoint backup path protection

Keywords: Flow assignment (FA), Protection algorithm

Algorithm for flow assignment problems which routes all traffic of each demand, through the shortest path, and then creates a backup path, measured in number of hops or in km, being this an user-defined parameter

Minimum bottleneck utilization routing using a tabu search heuristic

Keywords: Flow assignment (FA), Protection algorithm, Tabu search (TS)

Given a set of nodes and links, gith their capacities, an offered traffic, and a set of admissible paths for each demand (given by the k-shortest paths in km for each demand, being k a user-defined parameter), this algorithm uses a tabu search metaheuristic to find for each demand a link-disjoint 1+1 routes, so that the network congestion is minimized. For each demand, the candidate 1+1 pairs are computed as all the link disjoint pairs p1,p2, such that p1 and p2 are admissible paths.

Generic provisioning algorithm using protection segments

Keywords: Protection algorithm

Algorithm which implements a generic protection mechanism using pre-defined protection segments in the network design.