Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Detalhes bibliográficos
Autor principal: Gomes, Teresa (author)
Outros Autores: Jorge, Luísa (author), Melo, Paulo (author), Girão-Silva, Rita (author)
Formato: article
Idioma:eng
Publicado em: 2016
Assuntos:
min-sum
SLRG maximally disjoint
multi-objective
Texto completo:http://hdl.handle.net/10316/48331
País:Portugal
Oai:oai:estudogeral.sib.uc.pt:10316/48331

Texto Completo

http://hdl.handle.net/10316/48331

Registos relacionados