Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s11107-013-0408-0 | Photonic Network Communications |
Keywords | Field | DocType |
Integer programming,Column generation,Routing and spectrum allocation,Flexgrid optical networks | Column generation,Telecommunications network,Computer science,Algorithm,Integer programming,Information engineering,RSA problem,Frequency allocation,Distributed computing | Journal |
Volume | Issue | ISSN |
26 | 2-3 | 1572-8188(Series Online ISSN)1387-974X(Series Print ISSN) |
Citations | PageRank | References |
12 | 1.04 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Ruiz | 1 | 93 | 24.96 |
| Michal Pióro | 2 | 293 | 50.26 |
| Mateusz Żotkiewicz | 3 | 57 | 6.97 |
| Mirosław Klinkowski | 4 | 161 | 10.26 |
| Luis Velasco | 5 | 53 | 8.56 |