New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints
Multi-Protocol Label Switching (MPLS) has been proposed as a new approach which combines the benefits of interworking and routing in layer 3 and layer 2 i.e., Network layer and Data Link Layer. But its major technological significance lies in implementing Traffic Engineering. The most important requirement of TE is that the characteristics, as well as resource availability, on links on the network (in addition to bandwidth that would be used for cost computations) be propagated across the network to allow efficient choice of possible TE LSP paths. In this paper, the authors propose a new constraint based routing algorithm for MPLS networks.