Brief description
Algorithm which implements a generic protection mechanism using pre-defined protection segments in the network design.
Algorithm description table
| Algorithm inputs | A complete network design. Algorithm parameters:
|
|---|---|
| Algorithm outputs | A set of provisioning actions: rerouting, restore to primary path, block route |
| Required libraries | None |
| Keywords | Protection algorithm |
| Authors | Pablo Pavón Mariño, José Luis Izquierdo Zaragoza |
| Date | March 2013 |
| Code | NRSim_AA_genericProtectionAlgorithm.java |
Detailed description
Upon failure, try to route the traffic over the primary path if it is available and there is enough capacity. Otherwise, try to route the traffic over a backup path including some protection segment. To do this, an auxiliary graph composed of links in the original path and the associated protection segments with enough spare capacity is generated. Then, Dijkstra's shortest path algorithm is applied to get the backup path. If fails, the route cannot be restored.
Upon reparation, try to restore each rerouted connection to their original path, using a make-before-break strategy, only in case 'revertiveMode' is enabled. Then, still-failing routes are tried to be restored as under failure events.
