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)
AbstTactWe address a comprehensive design issue of a centralized communication network with logical star-star topology: each established hub is connected to the center node via its own cable route which may pass through a number of sites, and so is the connection from a user to its destination hub. The study distinguishes itself from other network design(More)
  • 1