Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Minimization of label usage in (G) MPLS network

In English

Författare

  • A. Tomaszewski
  • Michal Pioro

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.

Publiceringsår

2009

Språk

Engelska

Sidor

1053-1057

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Ämne

  • 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

Forskningsgrupp

  • Networking

ISBN/ISSN/Övrigt

  • ISSN: 1058-6393
  • ISBN: 978-1-4244-5825-7