Is dynamic dedicated path protection tractable?

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Szcześniak, Ireneusz, Olszewski, Ireneusz, Woźna-Szcześniak, Bożena
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909105719869440
author Szcześniak, Ireneusz
Olszewski, Ireneusz
Woźna-Szcześniak, Bożena
author_facet Szcześniak, Ireneusz
Olszewski, Ireneusz
Woźna-Szcześniak, Bożena
contents Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.
format Preprint
id arxiv_https___arxiv_org_abs_2310_14941
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Is dynamic dedicated path protection tractable?
Szcześniak, Ireneusz
Olszewski, Ireneusz
Woźna-Szcześniak, Bożena
Networking and Internet Architecture
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.
title Is dynamic dedicated path protection tractable?
topic Networking and Internet Architecture
url https://arxiv.org/abs/2310.14941