Impairment- and fragmentation-aware, energy-efficient dynamic RMSCA for SDM-EONs

Abstract

This paper presents a routing, modulation, spectrum, and core allocation (RMSCA) algorithm for space-division multiplexing-based elastic optical networks (SDM-EONs). A network state-dependent route and core selection method is proposed using a multi-attribute decision-making method based on the analytic hierarchy process (AHP) and preference ranking organization method for enrichment evaluations (PROMETHEE) methods. This systematic resource allocation allows the network designer to choose which resources are most valuable. It is followed by a spectrum allocation algorithm using a weighted score function to rate and select the best spectrum blocks. Physical layer impairments, including inter-core cross talk, amplified spontaneous emission, and Kerr fiber nonlinearities, are considered alongside fragmentation and energy consumption. The proposed RMSCA approach is compared with published benchmarks incorporating quality of transmission constraints and evaluated on two network topologies, NSFNET (7- and 12-core multicore fiber links) and COST. It is shown to be superior in terms of blocking probability, bandwidth blocking probability, network fragmentation, and energy consumption compared to standard and published benchmarks.

A New Algorithm to Mitigate Fragmentation and Crosstalk in Multi-Core Elastic Optical Networks

“…In addition to classical spectrum allocation policies, many works in the literature have investigated more efficient ways to improve resource allocation in SDM-EON. Some of these works propose XT-aware strategies to deal with the problem of inter-core crosstalk [11][12][13][14][15][16][17][18][19][20][21][22]. On the other hand, the XT-avoid strategies appear as a low computational cost option [13,[23][24][25][26].…”

“…All related works deal with inter-core crosstalk either by the XT-avoid or XT-aware approaches. Related to the spectrum fragmentation issue, some works implement mechanisms to reduce fragmentation in the resource allocation process [12,[17][18][19][20][21]23,24]. Some of these works were performed through a static traffic matrix, while others generated arrivals and ends of new requests dynamically.…”

“…Therefore, the algorithms compared to the proposed algorithm on performance evaluation (Section 5) are also XT-avoid, and are designed for dynamic traffic. [24] yes yes XT-avoid dynamic 7 [11] yes no XT-aware dynamic 3, 7, and 12 [12] yes yes XT-aware dynamic 7 [25] yes no XT-avoid dynamic 7 [13] yes no XT-avoid dynamic 7 and 19 [14] yes no XT-aware static 3 and 7 [26] yes no XT-avoid dynamic 7 [15] yes no XT-aware static 3, 7, and 19 [16] yes no XT-aware static 6 and 7 [17] yes yes XT-aware dynamic 3 and 7 [18] yes yes XT-aware dynamic 7 [19] yes yes XT-aware static 7 [20] yes yes XT-aware dynamic 7 and 12 [21] yes yes XT-aware dynamic 7 [22] yes no XT-aware dynamic 7…”