AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT

Abstract This paper deals with a traffic grooming and light-path routing problem in WDM-ring networks, where the number of light-paths to be used for each traffic demand is restricted. With a network augmen-tation by adding a dummy node and a set of dummy arcs, we formulate the comprehensive problem as a mixed Integer Programming problem. Owing to the computational complexity, it is hard to find an optimal solution for a large-scale network within a reasonable computation time. Hence, we develop a heuristic algorithm to solve it with easy. Our heuristic generates good feasible solutions within a few second in com-putation time even for large-scale networks. The computational experiments show that the performance of the proposed heuristic is satisfactory in both the speed and the quality of the solutions generated