Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909224079982592 |
|---|---|
| author | Rubtsov, Alexander Bauwens, Bruno Shmelkin, Dmitri Rudenko, Elizaveta Lavrov, Alexey |
| author_facet | Rubtsov, Alexander Bauwens, Bruno Shmelkin, Dmitri Rudenko, Elizaveta Lavrov, Alexey |
| contents | We consider the problem of single link failure in an elastic optical network, (also known as flex-grid WDM network). The task is to reroute optical connections that go through the broken link using free capacity of other links of the network. Nowadays, dynamic restoration gains popularity, in which the possiblity of rerouting is only inspected after a link failure is detected. Since the problem of recovery is NP-hard, heuristic algorithms are used to either find such routes, or suggest that the routes do not exist. In order to understand the quality of these heuristics, often mixed integer linear programming is used to obtain exact positive and negative answers. We present a detailed such model that checks whether restoration is possible without the use of additional regenerators. This means, that the new light paths need to satisfy a length constraint. As preprossing we apply a trimming procedure that takes advantage of this length constraint, and significantly speeds up the evaluation of these models. Our model is more general, and besides solving the problem of link restoration, also solves the full problem of wavelength and spectrum assignment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_10110 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration Rubtsov, Alexander Bauwens, Bruno Shmelkin, Dmitri Rudenko, Elizaveta Lavrov, Alexey Networking and Internet Architecture We consider the problem of single link failure in an elastic optical network, (also known as flex-grid WDM network). The task is to reroute optical connections that go through the broken link using free capacity of other links of the network. Nowadays, dynamic restoration gains popularity, in which the possiblity of rerouting is only inspected after a link failure is detected. Since the problem of recovery is NP-hard, heuristic algorithms are used to either find such routes, or suggest that the routes do not exist. In order to understand the quality of these heuristics, often mixed integer linear programming is used to obtain exact positive and negative answers. We present a detailed such model that checks whether restoration is possible without the use of additional regenerators. This means, that the new light paths need to satisfy a length constraint. As preprossing we apply a trimming procedure that takes advantage of this length constraint, and significantly speeds up the evaluation of these models. Our model is more general, and besides solving the problem of link restoration, also solves the full problem of wavelength and spectrum assignment. |
| title | Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2406.10110 |