Dynamic Online Routing Algorithm for Traffic Engineering in MPLS Network
Dang Ai-min · Journal of Northeastern University · 2006
Proposes a new online routing algorithm(NORA) for traffic engineering in MPLS network,where the link importance value(LIV) and link busy-degree(BD) are defined on the basis of topology of network and link's bandwidth utilization rate,respectively.When an LSP(label switching path) setting-up request arrives,the algorithm will compute the link-weight for each and every link in accordance to its LIV,current available bandwidth and BD,then choose the optimal path of link-weight for the incoming request using the idea of SPF(shortest path first) algorithm for the computed link-weight.This algorithm can set up LSPs with guaranteed bandwidth dynamically to balance the network load and decrease the refusing rate for LSPs request.Compared with SPF and MIRA(minimum interference routing algorithm) via simulation,the algorithm shows better performance in either decreasing refusing rate or balancing network load.