By Topic

A minimum interference routing algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. B. Figueiredo ; State Univ. of Campinas, Brazil ; N. L. S. da Fonseca ; J. A. S. Monteiro

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.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:4 )

Date of Conference:

20-24 June 2004