A bandwidth-based constraint routing algorithm for multi-protocol label switching networks
W. Sa-Ngiamsk, Sakchai Thipchaksurat, R. Varakutsiripunth · 2004
This paper presents a Constraint-Based Routing (CBR) algorithm for Multiprotocol 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 capability of routing with some specific constraints for supporting desire 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. The proposed algorithm is based on the weight calculation of an amounts of paths routed over each links in the network. From the simulation results, the proposed algorithm has well performance over high network utilization, low blocking percentage and low complexity.