A new low-complexity QoS routing algorithm for MPLS Traffic Engineering

Abstract

One of the important concepts in MPLS Traffic Engineering (TE) is LSP setup routing. The objective of routing algorithm is to increase the number of accepted request and satisfying Quality of Service (QoS) constrains. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements as QoS constrains. The previously published research have relied on load balancing to avoid network bottlenecks and produced longer and costly paths. Because of the longer paths, the routing quality as well as the efficiency of the network infrastructure has been degraded dramatically. This paper presents a novel Bandwidth Guarantee with Low Complexity (BGLC) algorithm for MPLS traffic engineering. In our paper, LSP setup requests are represented in terms of a pair of ingress and egress routers as well as their bandwidth requirement, and arrive one by one. Our paper does not consider a priori knowledge for future LSP setup requests and their characteristics. Our approach is an improvement of the well-known bandwidth constrained routing algorithms since it compromises among network load balancing, path length reduction, and minimizing path cost with low complexity. Simulation results reveal that in comparison with the most recent algorithms, BGLC presents better performances under a wide range of workload, topology and system parameters.