Models and algorithms of QoS-based routing with MPLS traffic engineering

Author

Xu, Ying-Xiao ; Zhang, Gen-Du

fYear

2002

fDate

2002

Firstpage

128

Lastpage

132

Abstract

MPLS QoS-based routing is tightly integrated to MPLS traffic engineering. Optimization objects and algorithms to select an optimized path in MPLS QoS-based routing are surveyed. Previous works based on weighted sum of cost and bandwidth, MIRA, PBR, etc. are discussed. By comparing the optimization goals of MIRA, such as MAX-MIN-MAX, WSUM-MAX and LEX-MAX, we present an improved model based on bandwidth prediction with the same inputs of MIRA. By analyzing the algorithms to get weighted graph and concepts of critical link and Δ-critical link, variable length Δ-critical link is presented to solve the problem of concentrator topology.

Keywords

graph theory; multiprotocol label switching; network topology; optimisation; quality of service; telecommunication network routing; telecommunication traffic; Δ-critical link; LEX-MAX; MAX-MIN-MAX; MIRA; MPLS routing; MPLS traffic engineering; QoS-based routing algorithms; QoS-based routing models; WSUM-MAX; bandwidth prediction; concentrator topology; link; optimization; variable length Δ-critical link; weighted cost-bandwidth sum; weighted graph; Bandwidth; Bioreactors; Constraint optimization; Costs; Electronic mail; Information science; Multiprotocol label switching; Routing; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

High Speed Networks and Multimedia Communications 5th IEEE International Conference on

Print_ISBN

0-7803-7600-5

Type

conf

DOI

10.1109/HSNMC.2002.1032561

Filename

1032561