EUVIMEDEUVIMED entdecken
Crossref

Dynamic routing and spectrum assignment in elastic optical networks using graph signal correlation

Mohammad Hossein Zarei, Mohammad Hadi, Mohammad Reza Pakravan

Journal of Optical Communications and Networking · 01.08.2026 · 18 (8) · 848

DOI: 10.1364/jocn.592663 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Optical Communications and Networking, online erschienen am 22.07.2026. Verfasst von Mohammad Hossein Zarei und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 26 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Elastic optical networks (EONs) have emerged as a flexible and spectrally efficient solution for future backbone infrastructures, where dynamic routing and spectrum assignment (RSA) is a key but complex resource allocation task. Existing RSA schemes are mainly based on heuristics, mathematical optimization, or machine learning and deep reinforcement learning, often trading off blocking performance, computational complexity, and interpretability. In this paper, we propose a graph signal correlation -based RSA (GSC-RSA) scheme that exploits graph signal processing (GSP) tools to perform dynamic and proactive optical resource allocation. The physical topology is first mapped to its line graph, and both the spectrum availability and the candidate paths are modeled as graph signals defined on the line graph nodes. A correlation-based metric is then defined between path signals and spectrum availability signals constructed from contiguous slot blocks. This metric jointly captures the feasibility of each path–block pair, the path length, and the load distribution over the network. For each incoming request, GSC-RSA evaluates this metric over all candidate path–block combinations and selects the one with the highest score in a single analytic decision step. We evaluate the proposed scheme under dynamic traffic on representative EON topologies and compare it against two classical K -shortest-path first-fit and exact-fit heuristics and two recent fragmentation-aware RSA algorithms. Simulation results indicate that GSC-RSA can significantly reduce request and bandwidth blocking probabilities while maintaining competitive spectrum utilization and per-request computational cost compatible with online operation. These results demonstrate that GSP provides an effective and scalable framework for dynamic RSA in EONs.

Zitieren

APA

Zarei, M. H., Hadi, M., & Pakravan, M. R. (2026). Dynamic routing and spectrum assignment in elastic optical networks using graph signal correlation. Journal of Optical Communications and Networking, 18(8), 848. https://doi.org/10.1364/jocn.592663

Vancouver

Zarei MH, Hadi M, Pakravan MR. Dynamic routing and spectrum assignment in elastic optical networks using graph signal correlation. Journal of Optical Communications and Networking. 2026;18(8):848. doi:10.1364/jocn.592663

BibTeX
@article{Zarei2026,
  author = {Zarei, Mohammad Hossein and Hadi, Mohammad and Pakravan, Mohammad Reza},
  title = {Dynamic routing and spectrum assignment in elastic optical networks using graph signal correlation},
  journal = {Journal of Optical Communications and Networking},
  year = {2026},
  volume = {18},
  number = {8},
  pages = {848},
  doi = {10.1364/jocn.592663}
}
Kostenlos starten →