Monday, 16:15 - 16:40 h, Room: H 3002

 

Philippe Mahey
Algorithms for lower and upper bounds for routing and wavelength assignment

Coauthors: Christophe Duhamel, Alexandre Martins, Rodney Saldanha, Mauricio Souza

 

Abstract:
In all-optical networks a traffic demand is carried from source to destination through a lightpath, which is a sequence of fiber links carrying the traffic from end-to-end. The wavelength continuity constraint implies that to a given lightpath a single wavelength must be assigned. Moreover, a particular wavelength cannot be assigned to two different lightpaths sharing a common physical link. The routing and wavelength assignment (RWA) problem arises in this context as to establish lightpaths to carry traffic demands. The problem is found in two versions: (i) to minimize the number of wavelengths to meet fixed traffic requests; and (ii) to maximize the traffic requests satisfied given a fixed number of wavelengths. In this work, we develop algorithms to tackle the RWA via lower and upper bounds. We present, by combining column generation models from the literature, a fast procedure to obtain lower bounds. We also present heuristic approaches based on variable neighborhood descent (VND) with iterated local search (ILS) for the min-RWA. We report numerical results showing optimality gaps obtained on benchmark instances from the literature.

 

Talk 3 of the invited session Mon.3.H 3002
"Optimization of optical networks" [...]
Cluster 23
"Telecommunications & networks" [...]

 

  Online lending company provides a wide range of ways to get money by means of Tennessee Loans Online. In rare cases, the smarting in eyes and the tumefaction of eyelids can happen. In case of long term Cialis Black administration the side effects become less perceptible or disappear at all.