Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Minimization of label usage in (G) MPLS network

Publiceringsår: 2009
Språk: Engelska
Sidor: 1053-1057
Publikation/Tidskrift/Serie: [Host publication title missing]
Dokumenttyp: Konferensbidrag


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering


43rd annual Asilomar conference on signals, systems and computers, 2009
  • Networking-lup-obsolete
  • ISSN: 1058-6393
  • ISBN: 978-1-4244-5825-7

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen