Minimization of label usage in (G) MPLS network
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.
