QoS routing as a tool of MPLS Traffic Engineering
Karol Kowalik, Martin Collier · 2001
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These problems can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. Multi Protocol Label Switching (MPLS) shows promise as a networking protocol which can provide such capabilities. However, existing routing protocols need to be enhanced or replaced by QoS-aware algorithms if this potential is to be realised. This paper presents a survey of emerging QoS routing methods for unicast flows suitable for usage within MPLS networks. We discuss basic algorithms such as Widest Shortest Path (WSP) and more complicated ones such as the Minimum Interference Routing (MIRA) or ProfileBased Routing. Then we propose a new QoS routing algorithm for Diff-Serv flows in MPLS networks. The method has two phases: off-line routing - based on daily statistics, which achieves efficient global network utilisation