m (Scipediacontent moved page Draft Content 376151458 to Puech et al 2007a) |
|||
| Line 3: | Line 3: | ||
We address the logical topology design problem (LTD) in WDM transport networks under static traffic assumptions. We start with one of the standard MILP formulations of the LTD problem that aims at optimizing the network congestion. We propose an improvement to this model that additionally optimizes the average hop count. We then derive a new MILP model that compels the traffic to be atomically routed. This last model enables fair comparisons of solutions obtained with MILP formulations and with metaheuristic algorithms. The latter allow us to deal with large size networks whereas the former are limited by their computational complexity. In this paper Tabu Search is used to tackle the LTD problem. We compare and discuss the logical topologies computed by the various methods described in the paper. | We address the logical topology design problem (LTD) in WDM transport networks under static traffic assumptions. We start with one of the standard MILP formulations of the LTD problem that aims at optimizing the network congestion. We propose an improvement to this model that additionally optimizes the average hop count. We then derive a new MILP model that compels the traffic to be atomically routed. This last model enables fair comparisons of solutions obtained with MILP formulations and with metaheuristic algorithms. The latter allow us to deal with large size networks whereas the former are limited by their computational complexity. In this paper Tabu Search is used to tackle the LTD problem. We compare and discuss the logical topologies computed by the various methods described in the paper. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/3-540-47906-6_24 http://link.springer.com/content/pdf/10.1007/3-540-47906-6_24], | ||
| + | : [http://dx.doi.org/10.1007/3-540-47906-6_24 http://dx.doi.org/10.1007/3-540-47906-6_24] | ||
| + | |||
| + | * [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_24.pdf], | ||
| + | : [https://link.springer.com/chapter/10.1007/3-540-47906-6_24 https://link.springer.com/chapter/10.1007/3-540-47906-6_24], | ||
| + | : [https://dblp.uni-trier.de/db/conf/networking/networking2002.html#PuechKG02 https://dblp.uni-trier.de/db/conf/networking/networking2002.html#PuechKG02], | ||
| + | : [https://www.scipedia.com/public/Puech_et_al_2007a https://www.scipedia.com/public/Puech_et_al_2007a], | ||
| + | : [https://rd.springer.com/chapter/10.1007/3-540-47906-6_24 https://rd.springer.com/chapter/10.1007/3-540-47906-6_24], | ||
| + | : [https://academic.microsoft.com/#/detail/1554375058 https://academic.microsoft.com/#/detail/1554375058] | ||
Latest revision as of 16:02, 21 January 2021
Abstract
We address the logical topology design problem (LTD) in WDM transport networks under static traffic assumptions. We start with one of the standard MILP formulations of the LTD problem that aims at optimizing the network congestion. We propose an improvement to this model that additionally optimizes the average hop count. We then derive a new MILP model that compels the traffic to be atomically routed. This last model enables fair comparisons of solutions obtained with MILP formulations and with metaheuristic algorithms. The latter allow us to deal with large size networks whereas the former are limited by their computational complexity. In this paper Tabu Search is used to tackle the LTD problem. We compare and discuss the logical topologies computed by the various methods described in the paper.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2007
Volume 2007, 2007
DOI: 10.1007/3-540-47906-6_24
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?