Ronaldo Moreira Salles,  Vitor Guerra Rolla. 

This work presents an alternative analysis for the shortest path optimal routing problem and proposes novel heuristic methods to solve it. In practical terms, a solution for the shortest path optimal routing problem determines the link weights that optimizes a computer network operating under standard routing protocols (e.g. OSPF). We based our solution on traffic engineering techniques that respect the OSPF routing model. We considered the main objectives of traffic engineering, such as: load balancing, better use of available resources and capacity to support growing traffic demands. Our proposal presents better results than traditional approaches.

http://www.lbd.dcc.ufmg.br:8080/colecoes/sbrc/2006/st12_1.pdf

Processando consulta.