Is dynamic dedicated path protection tractable?
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Towards an Efficient and Exact Algorithm for Dynamic Dedicated Path ProtectionEntropy, 2021
- Generic Dijkstra for optical networksJournal of Optical Communications and Networking, 2019
- Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical NetworksIEEE Access, 2019
- The complexity of finding maximum disjoint paths with length constraintsNetworks, 1982
- Disjoint paths in a networkNetworks, 1974