Traffic Grooming and Wavelength Assignment in Unidirectional SDH/WDM Ring

摘要

In unidirectional SDH/WDM rings traffic grooming and wavelength assignment problem is very important. We formulate the problem as a combinatorial optimization problem. For distance dependence traffic pattern, we obtain a low bound of ADMs (D_(LB)) by analysis. Then we propose a simulated annealing (SA) heuristic algorithm to solve the problem for uniform traffic and dependence traffic pattern. For distance dependence traffic pattern, we compare D_(LB) with the result obtained by SA. For uniform traffic, we compare the results obtain by SA and the greedy algorithm (GA) which was proposed by the paper. It shows that SA could get better results than GA.