A minimum interference routing algorithm with reduced computational complexity

Authors:
Gustavo B. Figueiredo;Nelson L. S. da Fonseca;José A. S. Monteiro
Affiliations:
Institute of Computing, State University of Campinas, Campinas, SP, Brazil;Institute of Computing, State University of Campinas, Campinas, SP, Brazil;NUPERC, Salvador University, Salvador, Brazil
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2006

Citing 14
Cited 1

Introduction to algorithms

Introduction to algorithms
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Internet traffic engineering using multi-protocol label switching (MPLS)

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Comparative analysis of path computation techniques for MPLS traffic engineering

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Optimal policy for label switched path setup in MPLS Networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Flow routing in computer networks

Flow routing in computer networks
Routing support for providing guaranteed end-to-end quality-of-service

Routing support for providing guaranteed end-to-end quality-of-service
A new path selection algorithm for MPLS networks based on available bandwidth estimation

QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
MPLS and traffic engineering in IP networks

IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Channel reusability for burst scheduling in OBS networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimum interference routing algorithms are designed to reduce rejections of future requests for the establishment of Label Switched Paths (LSPs) but make no assumption about specific patterns of arrival request. This paper introduces a novel minimum interference routing algorithm, Light Minimum Interference Routing (LMIR), which is based on a new approach to the identification of critical links. This approach reduces the computational complexity involved in finding a path for the establishment of an LSP. The LMIR is shown to have the same precision as existing algorithms but with less computational complexity.