Label space reduction in MPLS networks: how much can a single stacked label do?
IEEE/ACM Transactions on Networking (TON)
SNDlib 1.0—Survivable Network Design Library
Networks - Network Optimization (INOC 2007)
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Creating multipoint-to-point LSPs for traffic engineering
IEEE Communications Magazine
| Hi-index | 0.00 |
The paper considers a problem of minimizing the total number of labels that are necessary to realize a given set of end-to-end connections in a GMPLS transport network where traffic is handled by means of Label Switched Paths--connections established using the label switching principle. The problem is important for the networks where labels are a scarce/expensive resource, like in optical networks. We formulate an appropriate mixed-integer programming problem and discuss the ways it can be approached by the commercial solvers. We illustrate the effectiveness of the solution with numerical examples