Otimização Lagrangeana em Engenharia de Tráfego para Redes IP sobre MPLS

Roberto Alexandre DiasEduardo Camponogara: Jean-Marie FarinesRoberto WillrichAdriano Campestrini

In this paper we present optimization-based techniques for traffic engineering (TE) problems in IP networks over Multiprotocol Label Switching (MPLS). We model the TE tasks as a mathematical programming problem and propose heuristic algorithms to approximately solve this computationally hard problem. The use of Lagrangean relaxation together with heuristics proved to be effective, meaning that near-optimal solutions were reached within a sort time bound. The experimental results demonstrate that the Lagrangean-based routing algorithm proposed herein, outperforms standard algorithms, with respect to performance parameters such as throughput and data packet-loss rate.

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: