1. A column generation approach for large-scale RSA-based network planning
- Author
-
Luis Velasco, Jaume Comellas, Marc Ruiz, Mateusz Zotkiewicz, Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, and Universitat Politècnica de Catalunya. GCO - Grup de Comunicacions Òptiques
- Subjects
Lineal programming ,Mathematical optimization ,Computer science ,Distributed computing ,Contiguity ,Column Generation ,Binary number ,Fibres òptiques ,Programació lineal ,Frequency allocation ,Network planning and design ,Matrix (mathematics) ,Enginyeria de la telecomunicació::Telecomunicació òptica::Fibra òptica [Àrees temàtiques de la UPC] ,Routing and Spectrum Allocation ,Optical fibers ,Column generation ,Decomposition method (constraint satisfaction) ,Granularity ,Flexgrid Optical Networks ,Informàtica::Programació [Àrees temàtiques de la UPC] - Abstract
In flexgrid-based optical networks, the problem of finding optimal route and spectrum allocation (RSA) for the demands in a traffic matrix becomes harder to solve than similar problems in fixed DWDM networks, mainly due to the finer spectrum granularity and the spectrum contiguity and continuity constraints. Additionally, the increasing traffic volumes and the size of real networks lead to network planning problem instances consisting of hundreds of thousands, or even millions, of (binary) variables. In this work, we present a column generation decomposition method to obtain feasible solutions for RSA-based network planning problems. Numerical results show the utility of this method for solving intractable instances.
- Published
- 2013