Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
Path protection is a fast and capacity-efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case, it may be admissible to consider a path pair which is as disjoint as possible, and thus provi...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/15397 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/15397 |