Algorithms for Designing WDM Networks and Grooming the Traffic

摘要

In this paper, we propose a model for the global design problem of wavelength division multiplexing (WDM) networks including the traffic grooming. This problem consists in finding the number of fibers between each pair of node, selecting the configuration of each node, choosing the set of lightpaths (i.e., the virtual topology), routing these light-paths over the physical topology and finally, grooming and routing the traffic over the lightpaths. Since this problem is NP-hard, we propose heuristic algorithms and a tabu search metaheuristic algorithm to find good solutions for real-size instances rapidly.