Multi-step migration of optical connections to minimize disruption time in flex-grid networks

被引:0
作者
Tuan Khai Nguyen [1 ]
Reyes, Ronald Romero [1 ]
Bauschert, Thomas [1 ]
机构
[1] Tech Univ Chemnitz, Chair Commun Networks, D-09126 Chemnitz, Germany
关键词
Optical fiber networks; Mathematical models; Delays; Wavelength division multiplexing; Service level agreements; Visualization; Transponders; SPECTRUM DEFRAGMENTATION; RECONFIGURATION; FRAGMENTATION; OPTIMIZATION;
D O I
10.1364/JOCN.463702
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Migration of optical connections in flex-grid networks has become increasingly necessary as the arrivals and departures of optical connection requests are more dynamic. To mitigate disruptions of existing connections during migration, former research applies the resource dependency digraph (RDD) model to allow for sequential migration of optical connections. In this paper, we argue that, in this RDD model, each connection has a quota of one migration step only and that this one-step-quota constraint can be safely lifted to accomplish even lower disruption time due to the greater degree of migration freedom. We consider the whole migration process to be composed of multiple lightpath assignment states, each of which is to be determined individually. We show that this consideration can drastically reduce disruption time and hence the ensuing service level agreement violation penalties, even when it is already minimized under the one-step-quota constraint. For that, we propose two mathematical models. The first model, namely, multi-step optical connection migration (MOCM), adopts a layer-based abstraction in which each lightpath assignment state is represented as a layer, and the transition between two consecutive layers constitutes a migration step. In the second model, namely, MOCM2, to improve the solution efficiency, we readopt the concept of RDD and integrate multiple RDDs into MOCM to further enable even larger migration freedom. This way, the transition between two consecutive layers may involve multiple so-called meta-migration steps. As a use case, the proposed approaches are applied to perform connection migration for spectrum defragmentation. The results show that our multi-step migration scheme notably reduces disruption time as compared with the one-step-quota RDD-based approaches.
引用
收藏
页码:866 / 881
页数:16
相关论文
共 28 条
[1]  
Ahmed J., 2011, 15 INT C OPTICAL NET
[2]  
[Anonymous], 2009, Introduction to Algorithms
[3]   Defragmentation Scheme Based on Exchanging Primary and Backup Paths in 1+1 Path Protected Elastic Optical Networks [J].
Ba, Seydou ;
Chatterjee, Bijoy Chand ;
Oki, Eiji .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) :1717-1731
[4]  
Black P. E., 1998, Dictionary of algorithms and data structures
[5]   Fragmentation Problems and Management Approaches in Elastic Optical Networks: A Survey [J].
Chatterjee, Bijoy Chand ;
Ba, Seydou ;
Oki, Eiji .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (01) :183-210
[6]   Proactive defragmentation in elastic optical networks under dynamic load conditions [J].
Comellas, Jaume ;
Vicario, Laura ;
Junyent, Gabriel .
PHOTONIC NETWORK COMMUNICATIONS, 2018, 36 (01) :26-34
[7]   Ant colony optimization -: Artificial ants as a computational intelligence technique [J].
Dorigo, Marco ;
Birattari, Mauro ;
Stuetzle, Thomas .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39
[8]   Spectrum defragmentation algorithms in elastic optical networks [J].
Fernandez-Martinez, Sergio ;
Baran, Benjamin ;
Pinto-Roa, Diego P. .
OPTICAL SWITCHING AND NETWORKING, 2019, 34 :10-22
[9]  
Griva I, 2009, OTHER TITL APPL MATH, V108, P1, DOI 10.1137/1.9780898717730
[10]  
Gunther M., 2010, P 1 WORKSH DYN ASP D, P13, DOI [10.1145/1772630.1772635, DOI 10.1145/1772630.1772635]