A minimum interference routing algorithm
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1942-1947 Vol.4
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- A new bandwidth guaranteed routing algorithm for MPLS traffic engineering2003
- How to model an internetwork2002
- Minimum interference routing with applications to MPLS traffic engineering2002
- Beyond the flow decomposition barrierJournal of the ACM, 1998
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988