A LOCAL SEARCH ALGORITHM FOR THE GLOBAL DESIGN OF WDM NETWORKS INCLUDING THE TRAFFIC GROOMING

摘要

In this paper, we propose a model for the global design problem of wavelength division multiplexing (WDM) net-works including the traffic grooming. This problem con-sists in finding the number of fibers between each pair of nodes, finding the configuration of each node related to the number of transmitters and receivers (transponders), finding the virtual topology which is the set of the light-paths, routing the lightpaths, grooming and routing the traf-fic over the lighpaths and, finally, assigning wavelengths to the lightpaths. Since this problem is NP-hard, we propose heuristics and a local search algorithm to find good solu-tions for real-size instances within a reasonable amount of computational time.