Traffic grooming and wavelength routing for all optical wavelength division multiplexer-ring network

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. Hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.