Investigating the Impact of Fragmentation on Blocking Performance in Spectrally-Spatially Elastic Optical Networks

Spectrally-spatially elastic optical networks (SS-EONs) face challenges such as fragmentation and crosstalk, which lead to a rise in blocking probability. Accurate modeling of fragmentation and blocking probability is complex due to multiple constraints in SS-EONs. We evaluate the average fragmentation without considering spectrum contiguity constraints while simultaneously avoiding inter-core and inter-mode crosstalks in SS-EONs, which has not been studied in previous research. This study employs a continuous-time Markov chain-based analytical model to compute average fragmentation and blocking probability under different spectrum allocation policies—core-mode-spectrum random fit (CMS-RF) and core-mode-spectrum first fit (CMS-FF)—without contiguity constraints while simultaneously avoiding inter-core and inter-mode crosstalks in SS-EONs. The model considers both single-class and multi-class requests, where single-class requests use a uniform number of slots, and multi-class requests have variable slot requirements. Additionally, an iterative approximation model is introduced to improve scalability in single-hop links. Numerical results show that both the analytical model and simulations demonstrate lower blocking probability when contiguity constraints are not enforced, with CMS-FF performing better than CMS-RF in reducing fragmentation.

Authors

Institutions

Publication Details

Published
2025-05-20
DOI
https://doi.org/10.1109/hpsr64165.2025.11038883
Primary Topic
Advanced Optical Network Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Investigating the Impact of Fragmentation on Blocking Performance in Spectrally-Spatially Elastic Optical Networks

Eiji Oki, Bijoy Chand Chatterjee, Imran Ahmed
Advanced Optical Network Technologies
article

Investigating the Impact of Fragmentation on Blocking Performance in Spectrally-Spatially Elastic Optical Networks

Eiji Oki, Bijoy Chand Chatterjee, Imran Ahmed
article en

Abstract

Spectrally-spatially elastic optical networks (SS-EONs) face challenges such as fragmentation and crosstalk, which lead to a rise in blocking probability. Accurate modeling of fragmentation and blocking probability is complex due to multiple constraints in SS-EONs. We evaluate the average fragmentation without considering spectrum contiguity constraints while simultaneously avoiding inter-core and inter-mode crosstalks in SS-EONs, which has not been studied in previous research. This study employs a continuous-time Markov chain-based analytical model to compute average fragmentation and blocking probability under different spectrum allocation policies—core-mode-spectrum random fit (CMS-RF) and core-mode-spectrum first fit (CMS-FF)—without contiguity constraints while simultaneously avoiding inter-core and inter-mode crosstalks in SS-EONs. The model considers both single-class and multi-class requests, where single-class requests use a uniform number of slots, and multi-class requests have variable slot requirements. Additionally, an iterative approximation model is introduced to improve scalability in single-hop links. Numerical results show that both the analytical model and simulations demonstrate lower blocking probability when contiguity constraints are not enforced, with CMS-FF performing better than CMS-RF in reducing fragmentation.

Kyoto University (JP), South Asian University (IN)
Openalex Percentile: Top 88%
Advanced Optical Network Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.