An Efficient Algorithm for Solving Traffic Grooming Problems in Optical Networks

Date Added: Sep 2012
Format: PDF

The authors consider the Virtual Topology and Traffic Routing (VTTR) problem, a sub-problem of traffic grooming that arises as a fundamental network design problem in optical networks. The objective of VTTR is to determine the minimum number of light-paths so as to satisfy a set of traffic demands, and does not take into account physical layer constraints; a Routing and Wavelength Assignment (RWA) algorithm must reconcile the virtual topology obtained by VTTR with the physical topology. They propose an efficient algorithms that uses a partial LP relaxation technique with lazy constraints to improve substantially the scalability of VTTR, and, hence, of traffic grooming.