A minimum interference routing algorithm
Gustavo B. Figueiredo, Nelson L. S. da Fonseca, José Augusto Suruagy Monteiro · 2004
Minimum interference routing is instrumental to MPLS traffic engineering under realistic assumptions of unknown traffic demand. This work presents a new algorithm for minimum interference routing, called light minimum interference routing (LMIR). This algorithm introduces a new approach for critical link identification that reduces the computational complexity. Results, derived via simulation, show that LMIR is precise and has indeed a low computational complexity.