Learn More
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 augmentation 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(More)
  • 1