Minimization of label usage in (G) MPLS network

A. Tomaszewski, Michal Pioro

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

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.
Original languageEnglish
Title of host publication[Host publication title missing]
Pages1053-1057
DOIs
Publication statusPublished - 2009
Event43rd annual Asilomar conference on signals, systems and computers, 2009 - Pacific Grove, CA, Pacific Groove, CA, United States
Duration: 2009 Nov 12009 Nov 4
Conference number: 43

Publication series

Name
ISSN (Print)1058-6393

Conference

Conference43rd annual Asilomar conference on signals, systems and computers, 2009
Country/TerritoryUnited States
CityPacific Groove, CA
Period2009/11/012009/11/04

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Minimization of label usage in (G) MPLS network'. Together they form a unique fingerprint.

Cite this