New Bandwidth Guaranteed QoS Routing Algorithm for MPLS Networks

Internet has become an integrated carrier gradually, which has multi business such as data, voice, video, multimedia and so on. New multimedia applications require the network to guarantee quality of service. MPLS network has the capability of routing with some specific constraints for supporting desired QoS, out of which bandwidth is the most important constraint. The efficient routing algorithm should have low computational complexity, high network utilization and low call blocking percentage. This paper proposes a new Bandwidth guaranteed QoS routing algorithm based on MPLS networks. It is based on three objectives: Minimum interference levels with other source destination node pairs, optimizing the network resource utilization using Dijkstra’s algorithm and reducing algorithm complexity. The simulation results show that the proposed algorithm performs better in terms of network utilization, low call blocking percentage, reduced path length and low complexity.