The minimum cost design of transparent optical networks combining grooming, routing, and wavelength assignment

Agra, Agostinho and de Sousa, Amaro and Doostmohammadi, Mahdi (2016) The minimum cost design of transparent optical networks combining grooming, routing, and wavelength assignment. IEEE/ACM Transactions on Networking, 24 (6). pp. 3702-3713. ISSN 1063-6692 (https://doi.org/10.1109/TNET.2016.2544760)

[thumbnail of Agra-etal-IEEE-TN-2016-The-minimum-cost-design-of-transparent-optical-networks]
Preview
 Text. Filename: Agra_etal_IEEE_TN_2016_The_minimum_cost_design_of_transparent_optical_networks.pdf
Accepted Author Manuscript
Download (1MB)| Preview

Abstract

As client demands grow, optical network operators are required to introduce lightpaths of higher line rates in order to groom more demand into their network capacity. For a given fiber network and a given set of client demands, the minimum cost network design is the task of assigning routing paths and wavelengths for a minimum cost set of lightpaths able to groom all client demands. The variant of the optical network design problem addressed in this paper considers a transparent optical network, single hop grooming, client demands of a single interface type, and lightpaths of two line rates. We discuss two slightly different mixed integer linear programming models that define the network design problem combining grooming, routing, and wavelength assignment. Then, we propose a parameters increase rule and three types of additional constraints that, when applied to the previous models, make their linear relaxation solutions closer to the integer solutions. Finally, we use the resulting models to derive a hybrid heuristic method, which combines a relax-and-fix approach with an integer linear programming-based local search approach. We present the computational results showing that the proposed heuristic method is able to find solutions with cost values very close to the optimal ones for a real nation-wide network and considering a realistic fiber link capacity of 80 wavelengths. Moreover, when compared with other approaches used in the problem variants close to the one addressed here, our heuristic is shown to compute solutions, on average, with better cost values and/or in shorter runtimes.

ORCID iDs

Agra, Agostinho, de Sousa, Amaro and Doostmohammadi, Mahdi ORCID logoORCID: https://orcid.org/0000-0002-6865-8058;
  • Item type:Article
    ID code:65995
    Dates:
    Date
    Event
    31 December 2016
    Published
    7 April 2016
    Published Online
    8 March 2016
    Accepted
    Notes:(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
    Subjects:Technology > Electrical engineering. Electronics Nuclear engineering
    Department:Strathclyde Business School > Management Science
    Depositing user: Pure Administrator
    Date deposited:06 Nov 2018 10:45
    Last modified:11 Nov 2024 12:08
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/65995
CORE (COnnecting REpositories)