DocumentCode
415111
Title
A minimum interference routing algorithm
Author
Figueiredo, Gustavo B. ; Fonseca, Nelson L S da ; Monteiro, José A Suruagy
Author_Institution
State Univ. of Campinas, Brazil
Volume
4
fYear
2004
fDate
20-24 June 2004
Firstpage
1942
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
computational complexity; interference (signal); multiprotocol label switching; optimisation; telecommunication network routing; telecommunication traffic; MPLS traffic engineering; computational complexity; light minimum interference routing algorithm; optimization; Bandwidth; Computational complexity; Computational modeling; Costs; Instruments; Interference; Multiprotocol label switching; NP-complete problem; Routing; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8533-0
Type
conf
DOI
10.1109/ICC.2004.1312859
Filename
1312859
Link To Document