Minimization of label usage in (G) MPLS network
(2009) 43rd annual Asilomar conference on signals, systems and computers, 2009 p.1053-1057- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1716354
- author
- Tomaszewski, A. and Pioro, Michal LU
- organization
- publishing date
- 2009
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 1053 - 1057
- conference name
- 43rd annual Asilomar conference on signals, systems and computers, 2009
- conference location
- Pacific Groove, CA, United States
- conference dates
- 2009-11-01 - 2009-11-04
- external identifiers
-
- scopus:77953838763
- ISSN
- 1058-6393
- ISBN
- 978-1-4244-5825-7
- DOI
- 10.1109/ACSSC.2009.5470053
- language
- English
- LU publication?
- yes
- id
- de6a5bdb-1f22-4b61-bcd8-f415b55a2ced (old id 1716354)
- date added to LUP
- 2016-04-04 09:06:11
- date last changed
- 2022-01-29 08:17:25
@inproceedings{de6a5bdb-1f22-4b61-bcd8-f415b55a2ced, abstract = {{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 = {{Tomaszewski, A. and Pioro, Michal}}, booktitle = {{[Host publication title missing]}}, isbn = {{978-1-4244-5825-7}}, issn = {{1058-6393}}, language = {{eng}}, pages = {{1053--1057}}, title = {{Minimization of label usage in (G) MPLS network}}, url = {{http://dx.doi.org/10.1109/ACSSC.2009.5470053}}, doi = {{10.1109/ACSSC.2009.5470053}}, year = {{2009}}, }