An effective and applicable approach for traffic grooming in large WDM mesh networks

We propose a heuristic traffic grooming algorithm which is quite efficient in both time and cost. The simulation results show that our algorithm has a lower complexity compared with existing ones, an optimal cost and an acceptable blocking performance.