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. 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.
- Technology and Engineering
43rd annual Asilomar conference on signals, systems and computers
Pacific Groove, CA
- ISSN: 1058-6393
- ISBN: 978-1-4244-5825-7