The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks

The article discusses an online problem of routing and spectrum allocation with dedicated path protection in elastic optical networks. We propose three novel algorithms to solve this problem. The first of them is the minimum-cost–maximum-flow heuristic algorithm, which calculates the solution assumi...

Descripción completa

Detalles Bibliográficos
Autores principales: Olszewski, Ireneusz, Szcześniak, Ireneusz
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9318138/
https://www.ncbi.nlm.nih.gov/pubmed/35885114
http://dx.doi.org/10.3390/e24070891

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9318138/
https://www.ncbi.nlm.nih.gov/pubmed/35885114
http://dx.doi.org/10.3390/e24070891

Ejemplares similares