Column generation algorithm for RSA problems in flexgrid optical networks

Authors:
Marc Ruiz;Michał Pióro;Mateusz Żotkiewicz;Mirosław Klinkowski;Luis Velasco
Affiliations:
Computers Architecture Department, Universitat Politècnica de Catalunya, Barcelona, Spain 08034;Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland 00-665;Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland 00-665;Department of Transmission and Optical Technologies, National Institute of Telecommunications, Warszawa, Poland 04-894;Computers Architecture Department, Universitat Politècnica de Catalunya, Barcelona, Spain 08034
Venue:
Photonic Network Communications
Year:
2013

Citing 6
Cited 0

Algorithm 97: Shortest path

Communications of the ACM
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
On column generation formulations for the RWA problem

Discrete Applied Mathematics
Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies

IEEE Communications Magazine
Modeling the routing and spectrum allocation problem for flexgrid optical networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding optimal routes and spectrum allocation in flexgrid optical networks, known as the RSA problem, is an important design problem in transport communication networks. The problem is $$\mathcal{NP }$$NP-hard, and its intractability becomes profound when network instances with several tens of nodes and several hundreds of demands are to be solved to optimum. In order to deal with such instances, large-scale optimization methods need to be considered. In this work, we present a column (more precisely, path) generation-based method for the RSA problem. The method is capable of finding reasonable sets of lightpaths, avoiding large sets of precomputed paths, and leading to high-quality solutions. Numerical results illustrating effectiveness of the proposed method for obtaining solutions for large RSA problem instances are presented.