Robust Offline LSP Calculation for MPLS Networks

Paulo Roberto C. EstanteEdgard Jamhour

This paper proposes an offline method to compute LSPs (Label Switched Paths) for MPLS-based networks with support to path-protection. The objective of the method proposed in this paper is to generate optimal working and recovery paths for multiples demands subjected to capacity, delay and path constraints. The path constraints are imposed in order to achieve a robust LSPs planning, where the traffic demands could still be accommodated in the case of a single link failure in the network. By using a modified k-shortest path algorithm, we model the LPSs planning problem as search problem, which is solved using a genetic algorithm approach.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: