Abstract：Link Criticality Routing Algorithm (LCRA) is presented for Multi-Protocol Label Switch (MPLS) traffic engineering. It defines the link weight and chooses a path for a Label Switch Path set-up request through defining the average expectation load of links and determining the criticality of links. The main objective of LCRA is to swiftly set up paths as many as possible with bandwidth guaranteed, and make these paths go through evenly the network. Simulation shows the algorithm is better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost.
2007, Vol. 29 
