Application of the theory of the Multicommodity for the flows distribution in MPLS networks


Abstract:

Multicommodity network flows models are computationally challenging due to the large dimension of real instances, as those from the fields of telecommunications specifically in Multiprotocol Label Switching (MPLS). MPLS is extends the IP destination based routing protocols to provide new and scalable routing capabilities in connectionless networks using a relatively simple packet forwarding mechanism. MPLS networks carry traffic on virtual connections called Label Switched Path (LSP). This paper considers distributed D-LSP mechanism, each sub-LSP is set up on a different node-disjoint route. We propose an analytical method that allows minimizing spare bandwidth using the optimization multicommodity Flows technique, specifically applying the reformulation with path flows. The results show that there is an optimization of the spare bandwidth with Distributed LSP mechanism in comparison with conventional LSP.

Año de publicación:

2004

Keywords:

  • Multicommodity Network Flows
  • Minimum cost
  • MPLS
  • D-LSP
  • Traffic engineering

Fuente:

googlegoogle
scopusscopus

Tipo de documento:

Conference Object

Estado:

Acceso restringido

Áreas de conocimiento:

  • Red informática
  • Ciencias de la computación
  • Ciencias de la computación

Áreas temáticas:

  • Sistemas