Simulation of a New Constraint Based Routing Algorithm for Multi-Protocol Label Switching Networks

This paper presents modeling and simulation for constraint-based routing (CBR) algorithm for multi protocol label switching (MPLS) network which is designed for mapping among any layer-2 protocols and any layer-3 protocols of the OSI model. The MPLS network has the capability of routing with some specific constraints for supporting desired quality of service (QoS). The most important constraint is the demand bandwidth. The efficient routing algorithm should have low percentage of call-setup request blocking, high network utilization and low calculation complexity. There are many previously proposed algorithms such as minimum hop algorithm, widest shortest path algorithm and minimum interference routing algorithm. In this paper, a new algorithm is proposed which is based on the weight calculation of an amount of paths routed over each link in the network. The simulation results show that the proposed algorithm performs better in terms of network utilization, low blocking percentage and low complexity.