Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks

In elastic optical networks (EONs), an appropriate modulation technique is adapted according to the distance of an optical path. A robust modulation technique with a large number of spectrum slots is considered for longer distance optical paths, and a less robust modulation technique with a small number of spectrum slots is used for shorter distance optical paths. When an optical path is configured, the number of required spectrum slots is determined based on the nonlinear relationship between the optical path length and the number of utilized spectrum slots. Minimizing the total path lengths does not always minimize the total number of required spectrum slots for configuring an optical path, which decreases the spectrum utilization. This paper introduces a modulation-adaptive link-disjoint path selection model by considering a step function based on realistic modulation formats in order to minimize the total number of utilized spectrum slots in 1 + 1 protected EONs. We formulate the modulation-adaptive link-disjoint path selection problem as an integer linear programming (ILP). We prove that the modulation-adaptive link-disjoint path selection problem is NP-complete. By using an optimization solver, we solve the ILP problem for different backbone networks, namely, Japan Photonic Network (JPN48), German 17 Network, and COST 239 Network, within a practical time. Numerical results obtained from performance evaluation indicate that the introduced model reduces the number of utilized spectrum slots compared to the conventional schemes

Protection in space division multiplexing elastic optical networks

Orientador: Nelson Luis Saldanha da FonsecaTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: A multiplexação por divisão espacial é uma solução promissora para que as redes ópticas elásticas possam lidar com o esgotamento esperado da capacidade das redes de único núcleo. A introdução da multiplexação por divisão espacial em redes ópticas traz novos desafios para proteção de redes, uma vez que um caminho de luz pode abranger uma alta capacidade e transmitir dados a diferentes taxas. Adicionalmente, a enorme quantidade de tráfego nestas redes provocam a necessidade de proteção contra falhas, uma vez que essas são relativamente frequentes; atualmente, a taxa de falha de um corte de fibra é uma a cada quatro dias. Muitos estudos sobre redes ópticas têm sido desenvolvidos e relatados na literatura. No entanto, apenas recentemente, o estudo de multiplexação espacial para redes ópticas elásticas tem sido considerado. Nesse contexto, embora algoritmos de roteamento e alocação de núcleo e espectro tenham sido propostos na literatura, poucos trabalhos consideram proteção. Além disso, o compartilhamento de recursos de backup não é considerado. Nesta tese, propõe-se soluções de proteção em redes ópticas elásticas com multiplexação espacial, visando a redução do bloqueio de requisições para estabelecimento de conexão, o melhoramento da utilização dos recursos em redes ópticas elásticas com multiplexação espacial, considerando diferentes cenários de carga e topologias. Para tal, o problema de proteção destas redes levará em consideração a utilização de caminhos de proteção, diferentes formatos de modulação, o uso de agregação de tráfego, o uso de sobreposição de espectro em caminhos de proteção, interferência mínima e roteamento multicaminho. Diversos algoritmos foram propostos e avaliados para prover 100% de proteção contra ocorrência de uma falha, bem como um algoritmo para proteção contra duas falhas simultâneas. Os resultados indicam que os algoritmos propostos produzem um melhor desempenho quando comparado ao desempenho dos algoritmos existentes na literaturaAbstract: Spatial division multiplexing is a promising solution proposed for elastic optical networks to cope with the expected depletion of the capacity of single core networks. The introduction of space division multiplexing in optical networks brings new challenges for network protection since a lightpath can span high capacity and transmit data at different rates. In addition, there is the great need for protection mechanisms against failure due to the high volume of traffic carried in these networks. Failure is quite frequent in operational optical networks, it is estimated that there is a failure every four hours. Several studies on optical networks have been carried out but, only recently, the study of spatial division multiplexing for elastic optical networks has been considered. In this context, although routing, spectrum, and core allocation algorithms have been proposed in the literature, only a few papers consider protection. In addition, sharing of backup resources is not considered. In this thesis, it is proposed to provide protection solutions in spatial division multiplexing elastic optical networks, for reducing the blocking of requests for connection establishment, as well as improving the use of resources, considering different load scenarios and topologies. For this, the protection problem of these networks will take into consideration the use of protection paths, different modulation formats, the use of traffic grooming, the use of spectrum overlap in protection paths, minimum interference and multipath routing. Several algorithms are proposed in this thesis to provide 100% protection against a single failure and one algorithm for two simultaneous failure. results indicate that these algorithms overperform existing onesDoutoradoCiência da ComputaçãoDoutor em Ciência da Computação165446/2015-3CNPQCAPE

エラスティック光ネットワークにおけるトラヒック収容性を向上させるための無瞬断デフラグメンテーション

In elastic optical networks (EONs), a major obstacle to using the spectrum resources efficiently is spectrum fragmentation. Much of the research activities in EONs focuses on finding defragmentation methods which remove the spectrum fragmentation. Among the defragmentation methods presented in the literature, hitless defragmentation has been introduced as an approach to limit the spectrum fragmentation in elastic optical networks without traffic disruption. It facilitates the accommodation of new request by creating large spectrum blocks, as it moves active lightpaths (retuning) to fill in gaps left in the spectrum by expired ones.　Nevertheless, hitless defragmentation witnesses limitations for gradual retuning with the conventionally used first fit allocation. The first fit allocation stacks all lightpaths to the lower end of the spectrum. This leads to a large number of lightpaths that need to be retuned and are subject to interfere with each other\u27s retuning. This thesis presents two schemes, which are based on hitless defragmentation, to increase the admissible traffic in EONs.　Firstly, a route partitioning scheme for hitless defragmentation in default EONs is presented. The proposed scheme uses route partitioning with the first-last fit allocation to increase the possibilities of lightpath retuning by avoiding the retuning interference among lightpaths. The first-last fit allocation is used to set a bipartition with one partition allocated with the first fit and the second with the last fit. Lightpaths that are allocated on different partitions cannot interfere with each other. Thus the route partitioning avoids the interferences among lightpaths when retuning. The route partitioning problem is defined as an optimization problem to minimize the total interferences.　Secondly, this thesis presents a defragmentation scheme using path exchanging in 1+1 path protected EONs. For 1+1 path protection, conventional defragmentation approaches consider designated primary and backup paths. This exposes the spectrum to fragmentations induced by the primary lightpaths, which are not to be disturbed in order to achieve hitless defragmentation. The presented path exchanging scheme exchanges the path function of the 1+1 protection with the primary toggling to the backup state while the backup becomes the primary. This allows both lightpaths to be reallocated during the defragmentation process while they work as backup, offering hitless defragmentation. Considering path exchanging, a static spectrum reallocation optimization problem that minimizes the spectrum fragmentation while limiting the number of path exchanging and reallocation operations is defined.　For each of the presented schemes, after the problem is defined as an optimization problem, it is then formulated as an integer linear programming problem (ILP). A decision version of each defined problem is proven NP-complete. A heuristic algorithm is then introduced for large networks, where the ILP used to represent the problem is not tractable. The simulation results show that the proposed schemes outperform the conventional ones and improve the total admissible traffic.電気通信大学201

エラスティック光ネットワークにおけるトラヒック収容性を向上させるための無瞬断デフラグメンテーション

In elastic optical networks (EONs), a major obstacle to using the spectrum resources efficiently is spectrum fragmentation. Much of the research activities in EONs focuses on finding defragmentation methods which remove the spectrum fragmentation. Among the defragmentation methods presented in the literature, hitless defragmentation has been introduced as an approach to limit the spectrum fragmentation in elastic optical networks without traffic disruption. It facilitates the accommodation of new request by creating large spectrum blocks, as it moves active lightpaths (retuning) to fill in gaps left in the spectrum by expired ones.　Nevertheless, hitless defragmentation witnesses limitations for gradual retuning with the conventionally used first fit allocation. The first fit allocation stacks all lightpaths to the lower end of the spectrum. This leads to a large number of lightpaths that need to be retuned and are subject to interfere with each other\u27s retuning. This thesis presents two schemes, which are based on hitless defragmentation, to increase the admissible traffic in EONs.　Firstly, a route partitioning scheme for hitless defragmentation in default EONs is presented. The proposed scheme uses route partitioning with the first-last fit allocation to increase the possibilities of lightpath retuning by avoiding the retuning interference among lightpaths. The first-last fit allocation is used to set a bipartition with one partition allocated with the first fit and the second with the last fit. Lightpaths that are allocated on different partitions cannot interfere with each other. Thus the route partitioning avoids the interferences among lightpaths when retuning. The route partitioning problem is defined as an optimization problem to minimize the total interferences.　Secondly, this thesis presents a defragmentation scheme using path exchanging in 1+1 path protected EONs. For 1+1 path protection, conventional defragmentation approaches consider designated primary and backup paths. This exposes the spectrum to fragmentations induced by the primary lightpaths, which are not to be disturbed in order to achieve hitless defragmentation. The presented path exchanging scheme exchanges the path function of the 1+1 protection with the primary toggling to the backup state while the backup becomes the primary. This allows both lightpaths to be reallocated during the defragmentation process while they work as backup, offering hitless defragmentation. Considering path exchanging, a static spectrum reallocation optimization problem that minimizes the spectrum fragmentation while limiting the number of path exchanging and reallocation operations is defined.　For each of the presented schemes, after the problem is defined as an optimization problem, it is then formulated as an integer linear programming problem (ILP). A decision version of each defined problem is proven NP-complete. A heuristic algorithm is then introduced for large networks, where the ILP used to represent the problem is not tractable. The simulation results show that the proposed schemes outperform the conventional ones and improve the total admissible traffic.電気通信大学201