Traffic Grooming in WDM Ring Networks with the Min-Max Objective

We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the MinMax objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads.

• Type: Conference
• Year: 2004
• Where: NETWORKING
• Authors: Bensong Chen, George N. Rouskas, Rudra Dutta
• Keywords: Dynamic Traffic Scenarios, Future Traffic Demands, NETWORKING 2004, NETWORKING 2007, Traffic Grooming