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
Main Author: | |
---|---|
Other Authors: | , , |
Format: | article |
Language: | eng |
Published: |
2016
|
Subjects: | |
Online Access: | http://hdl.handle.net/10316/48331 |
Country: | Portugal |
Oai: | oai:estudogeral.sib.uc.pt:10316/48331 |
Summary: | Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
---|