Minimization of label usage in (G) MPLS network

Summary, in English

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.

• Author: A. Tomaszewski; Michal Pioro
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2009
• Language: English
• Pages: 1053-1057
• Publication/Series: [Host publication title missing]
• Links: http://dx.doi.org/10.1109/ACSSC.2009.5470053
• Document type: Conference paper
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: 43rd annual Asilomar conference on signals, systems and computers, 2009
• Conference date: 2009-11-01 - 2009-11-04
• Conference place: Pacific Groove, CA, United States
• Status: Published
• Research group: Networking
• ISBN/ISSN/Other: ISSN: 1058-6393; ISBN: 978-1-4244-5825-7