Label switched protocol routing with guaranteed bandwidth and end to end path delay in MPLS networks

Abstract

Rapid growth of multimedia applications has caused a tremendous impact on how people communicate. Next generation networks (NGN) have been proposed to support newly emerged multimedia IP based applications such as voice over IP (VOIP), video on-demand (VOD), and IPTV using a core IP backbone. The development of technologies like Multi-Protocol Label Switching (MPLS) has laid the foundation for NGN to support multimedia applications like Voice over IP. One of the important concepts in MPLS Traffic Engineering (TE) is Label Switched Path (LSP) routing. The objective of the routing algorithm is to increase the number of accepted request while satisfying Quality of Service (QoS) constraints. Although much work has been done on laying MPLS paths to optimize performance, most of them have focused on satisfying bandwidth requirements. Relatively little research has been done on laying paths with both bandwidth and delay constraints. In this paper, we present a new bandwidth and end to end delay (bandwidth-delay) constrained routing algorithm which uses data of the ingress–egress node pairs in the network. In this algorithm we use LR-Servers theory to compute path delay. We name the proposed algorithm as Minimum Delay and Maximum Flow (MDMF). We do extensive simulations to evaluate the performance of MDMF algorithm. In addition, we compare the performance of MDMF against some previous related works such as MHA, WSP, MIRA, BCRA, MIRAD, BGDG, BGLC, and SAMCRA. The simulation results show that MDMF rivals them in terms of flow management and outperform them in terms of end to end delay management, maximum flow and number of accepted request (call blocking ratio).