Dynamic routing and frequency slot allocation in elastic optical path network using adaptive modulations with consideration of both spectrum availability and distance

Abstract

We proposed a dynamic routing and frequency slots allocation scheme which adopted the adaptive modulation for a novel Spectrum-sLICed Elastic optical path network (SLICE). In our dynamic routing scheme, both spectrum resource availability (SRA) and distance (hop number) are considered at the modulation format selection phase for adaptive modulation. We then conducted numerical simulation to compare our Spectrum Resource Adaptive and Distance Adaptive (SRA-DA) mechanism with previous DA in both small network topology and 7×7 mesh topology. Results shown that SRA-DA mechanism achieved lower blocking rate and higher slots utilization compared to DA in bigger networks.

Dynamic Routing and Spectrum Allocation in Elastic Optical Networks With Mixed Line Rates

“…These RSA schemes allow a demand to be split into multiple demands and transmitted on multiple paths. Thus, multipath-routing-based RSA/RMSA schemes [21,22] can dramatically reduce the blocking probability of traffic demands compared with single-path-routing-based RSA/RMSA schemes [17][18][19][20]. However, for multipath routing, the differential delay between routing paths will lead to increased cost of network devices and network maintenance.…”

“…However, the performance of MSP is unsatisfactory, and the computational complexity of SPV is very high. In addition, the studies reported in [17][18][19][20] assume that the traffic demands may have arbitrary bandwidth requirement, and the proposed algorithms are not appropriate for EONs with mixed regular line rates (e.g., 40∕100∕400 Gb∕s).…”

“…In [17,18], the authors proposed two KSP-based dynamic RSA algorithms, which examine k shortest candidate paths for each traffic demand and then choose the one with available spectrum. Since the candidate paths are predetermined, the KSP-based RSA algorithms perform badly for dynamic traffic demands with routing constraints.…”

“…The dynamic RSA/RMSA problem is investigated in [17][18][19][20]. In [17,18], the authors proposed two KSP-based dynamic RSA algorithms, which examine k shortest candidate paths for each traffic demand and then choose the one with available spectrum.…”

A Novel Resource Allocation and Spectrum Defragmentation Mechanism for IoT-Based Big Data in Smart Cities

“…Their efficient heuristic algorithms based on spectrum window planes were proposed for implementing distance and modulation format-adaptive RSA, so as to maximize spare capacity sharing among multiple protection paths. The authors of [15] proposed two dynamic RSA algorithms based on K shortest path (KSP); the algorithm needs to determine the candidate path in advance. In [16], the improved shortest path (MSP) algorithm and the spectrum constrained path vector search (SVP) algorithm were addressed, which can further improve network performance.…”