Traffic grooming is a central problem in optical networks. It refers to packing low rate signals
into higher speed streams, in order to improve bandwidth utilization and reduce network …

We consider the traffic grooming problem, a fundamental network design problem in optical
networks. We review a typical integer linear program formulation considered in the literature …

We study the minimization of ADMs (add-drop multiplexers) in optical WDM networks with
bidirectional ring topology considering symmetric shortest path routing and all-to-all unitary …

Traffic grooming is a central problem in optical networks. It refers to pack low rate signals
into higher speed streams, in order to improve bandwidth utilization and reduce network …

We consider the virtual topology and traffic routing (VTTR) problem, a subproblem of traffic
grooming that arises as a fundamental network design problem in optical networks. The …

We study a graph partitioning problem which arises from traffic grooming in optical networks.
We wish to minimize the equipment cost in a SONET WDM ring network by minimizing the …

We study the following graph partitioning problem: Given two positive integers C and Δ, find
the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ …

We study grooming for two-period optical networks, a variation of the traffic grooming
problem for wavelength division multiplexed (WDM) ring networks introduced by Colbourn …

We present a scalable formulation for the traffic grooming problem in WDM ring networks.
Specifically, we modify the ILP formulation to replace the constraints related to routing and …

In an optical network using the wavelength division multiplexing (WDM) technology, routing
a request consists of assigning it a route in the physical network and a wavelength. If each …