A carregar...

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Mahmoud Fayez, Iyad Katib, George N. Rouskas, Tarek F. Gharib, Heba Khaleed, Hossam M. Faheem
Formato: Artigo
Idioma:Inglês
Publicado em: Elsevier 2020-06-01
Colecção:Ain Shams Engineering Journal
Assuntos:
RSA
Acesso em linha:http://www.sciencedirect.com/science/article/pii/S2090447919301443
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!