A minimum interference routing algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Figueiredo, G.B., da Fonseca, N.L.S., Monteiro, J.A.S.
Format: Conference Proceeding
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Bandwidth
Computational complexity
Computational modeling
Conferences
Costs
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Information, signal and communications theory
Instruments
Interference
Multiprotocol label switching
NP-complete problem
Routing
Signal and communications theory
Signal, noise
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Traffic control
Transmission and modulation (techniques and equipments)
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICC.2004.1312859