Recursive algorithm for selecting optimum routing tables to solve offline routing and spectrum assignment problem

The Routing and Spectrum Assignment (RSA) problem is NP-Hard so searching the entire problem space is not applicable. Many decomposition algorithms rely on reducing the search space in the routing space and applying heuristics algorithm in the spectrum assignment sub-problem. This is not necessarily...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mahmoud Fayez, Iyad Katib, George N. Rouskas, Tarek F. Gharib, Heba Khaleed, Hossam M. Faheem
Format: Artigo
Sprache:Inglês
Veröffentlicht: Elsevier 2020-06-01
Schriftenreihe:Ain Shams Engineering Journal
Schlagworte:
RSA
Exhaustive routing search
RSA decomposition
Online Zugang:http://www.sciencedirect.com/science/article/pii/S2090447919301443
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

Ähnliche Einträge