Routing Algorithms for SDM Flexible Optical Networks
This paper considers the online routing, modulation, spectrum, and core allocation problem in elastic optical networks. Three algorithms are proposed to minimize the bandwidth blocking probability while taking into account the impact of interference from established lightpaths. These algorithms are...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/26/11/928 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper considers the online routing, modulation, spectrum, and core allocation problem in elastic optical networks. Three algorithms are proposed to minimize the bandwidth blocking probability while taking into account the impact of interference from established lightpaths. These algorithms are based on a sequence of alternative paths, ordered in terms of increasing lengths, determined by Yen’s algorithm. Each of the algorithms for the selected single or dual lightpath enforces the constraints of spectrum continuity, contiguity of the slots, and non-overlapping of the spectra with the established lightpaths, maximizes the number of bits per symbol, and selects a specific core on each link of the path. Simulation studies performed for two sample networks showed that the crosstalk has a significant impact on the bandwidth blocking probability. The best results were obtained by iterating over all paths and all slots, selecting the lightpath with the lowest average crosstalk per slot, consisting of the most loaded cores. |
|---|---|
| ISSN: | 1099-4300 |