Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks
VIGNAC, Benoit
Institut de Mathématiques de Bordeaux [IMB]
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT]
Institut de Mathématiques de Bordeaux [IMB]
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT]
VIGNAC, Benoit
Institut de Mathématiques de Bordeaux [IMB]
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT]
Language
en
Article de revue
This item was published in
Networks. 2016-07-01, vol. 67, n° 4, p. 277-298
Wiley
English Abstract
We consider a multi-layer network design model arising from a real-life telecommunication application where traffic routingdecisions imply the installation of expensive nodal equipment. Customer requests come in the form ...Read more >
We consider a multi-layer network design model arising from a real-life telecommunication application where traffic routingdecisions imply the installation of expensive nodal equipment. Customer requests come in the form of bandwidthreservations for a given origin destination pair. Bandwidth demands are expressed as multiples of nominal granularities. Each request must be single-path routed. Grooming several requests on the same wavelength and multiplexing wavelengths in the same optical stream allow a more efficient use of network capacity. However, each addition or withdrawal of a request from a wavelength requires optical to electrical conversion and the use of cross-connect equipment with expensive ports of high densities. The objective is to minimize the number of required ports of the cross-connect equipment. We deal with backbone optical networks, therefore with networks with a moderate number of nodes (14 to 20) but thousands of requests. Further difficulties arise from the symmetries in wavelength assignment and traffic loading. Traditional multi-commodity network flowapproaches are not suited for this problem. Instead, four alternative models relying on Dantzig-Wolfe and/or Benders' decomposition areintroduced and compared. The formulations are strengthened using symmetry breaking restrictions, variable domain reduction, zero-onediscretization of integer variables, and cutting planes. The resulting dual bounds are compared to the values of primal solutions obtained through hierarchical optimization and rounding procedures. For realistic size instances, our best approaches provide solutions with optimality gap of approximately 5% on average in around two hours of computing time.Read less <
Origin
Hal imported