Reoptimization of dynamic flexgrid optical networks after link failure repairs

In dynamic flexgrid optical networks, the usage of capacity may not be optimal due to the permanent process of setting up and tearing down connections, which, if not controlled, leads to spectrum fragmentation and, as a result, to increase of connection blocking. On top of this, a restoration mechan...

ver descrição completa

Detalhes bibliográficos
Autores: Zotkiewicz, Mateusz, Ruiz Ramírez, Marc|||0000-0001-6429-6347, Klinkowski, Miroslaw, Pioro, Michal, Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
Formato: artículo
Fecha de publicación:2015
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/82873
Acesso em linha:https://hdl.handle.net/2117/82873
https://dx.doi.org/10.1364/JOCN.7.000049
Access Level:acceso abierto
Palavra-chave:Comunicacions òptiques
Column generation
Flexgrid optical networks
Integer programming
Network survivability
Routing and spectrum assignment
Optical communications
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació
Descrição
Resumo:In dynamic flexgrid optical networks, the usage of capacity may not be optimal due to the permanent process of setting up and tearing down connections, which, if not controlled, leads to spectrum fragmentation and, as a result, to increase of connection blocking. On top of this, a restoration mechanism that is launched in reaction to a link failure (cable cut) restores the affected lightpaths. Eventually, when the cable is repaired and its capacity becomes available for new connections, the unbalance between lightly and heavily loaded links increases, thus further decreasing the probability of finding optical paths with continuous and contiguous spectrum for future connection requests. In this paper we study the effects of reoptimizing the lightpath connections after a link failure has been repaired [namely, the after-failure-repair optimization (AFRO) problem] as an effective way for both reducing and balancing capacity usage and, by these means, for improving network performance. To solve AFRO a column generation decomposition method is presented. Illustrative numerical results show that AFRO allows us to significantly decrease the request blocking probability in realistic dynamic network scenarios. Moreover, the proposed column generation algorithm delivers quasi-optimal solutions in reasonable times. Besides, traffic disruptions resulting from lightpath rerouting are practically negligible. Finally, we show that it is sufficient to apply AFRO only for a selected set of link failures in order to achieve high network performance.