Dynamic grooming and RWA in translucent optical networks using a time-slotted ILP

Translucent fiber-optic networks are carefully planned to achieve high capacity utilization efficiency as required by society´s ever-increasing traffic demand. Existing research treats the problem of resource placement largely as a static design problem, which is solved with linear programming (LP) to find the optimal solution. The dynamic operational problem (grooming, regeneration, routing, and wavelength assignment) is approached using heuristic methods with the goal of improving the overall network performance given an existing network infrastructure. Our work combines these two approaches and solves a real-time dynamic traffic scenario with integer linear programming (ILP), seeking to maximize the overall network throughput. The traffic is served in a time-slotted fashion so that the network throughput is optimized at each time slot given the existing network state. The solution is compared with results from existing heuristic methods. We incorporate physical impairment limitations into our network model, and consider several grooming options.