Using Genetic Algorithms to LSP Setup in MPLS Networks

Adriana OliveiraGeraldo Robson Mateus

This work addresses the problem of physical route selection for Label Switched Paths (LSPs) in Multi-Protocol Label Switching (MPLS) networks.The route selection problem consists of defining routes for LSPs trying to minimize the network rejection rate and the total number of hops necessary to route the requests. We propose a mathematical model to represent the problem and we present a genetic algorithm (GA) to solve the model. The experiments show that the GA is able to obtain very good solutions using a very short amount of time.

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: