WDM Network Design by ILP Models Based on Flow Aggregation

Light Path Optimization Implementation for Survivable Routing and Wavelength Assignment in Optical Networks

“…Some subsequent enhancement schemes to improve the ant-based routing performance include smart agents which use dynamic programming [5], Rajesh Rai . [6] proposed an ACO-based algorithm to solve the survivable RWA problem. When a new connection request arrives, a number of ants are launched from the source to the destination.…”

Providing resiliency for optical grids by exploiting relocation: A dimensioning study based on ILP

“…The authors of [15] have investigated these formulations in unprotected networks to conclude that although they have the same computational complexity, RF has the advantage of reducing the number of variables by imposing a restriction on the number of allowable paths between a source and a destination. In [16] the authors focus on the computational efficiency of the ILP model in order to provide a more effective tool for planning. The formulation exploits flow aggregation and consists in a new ILP formulation that can reach optimal solutions with less computational effort compared to other ILP approaches.…”

“…The formulation exploits flow aggregation and consists in a new ILP formulation that can reach optimal solutions with less computational effort compared to other ILP approaches. Yet, the solution of the so-called source formulation ILP in [16] requires a post-processing step to find the actual routing and wavelength assignment (RWA) and it does not consider resilient network dimensioning.…”

Tabu search optimization in translucent network regenerator allocation

“…To describe the ILP model, a notation similar to that of [10] is used: The set of source nodes. sq is the source node of the qth connection (q = 1, 2, ... , Q).…”