A Dynamic Routing Algorithm in MPLS Traffic Engineering
一种MPLS流量工程中的动态路由算法

A new algorithm for dynamic routing of bandwidth guaranteed flows in MPLS traffic engineering is presented.Traditional routing algorithms such as Shortest Path First or WSP do not take advantage of any knowledge about the traffic distribution or ingress egress pairs,and therefore can often lead to severe network underutilization.This method has two phases:off line routing based on daily statistics and traffic distribution,which achieves efficient global network utilization,facilitates path selection on on line phase and avoids congestion;on line routing based on off line routing and actual network state.However,the important point of the algorithm is that a new on line dynamic routing algorithm is proposed,which improves the on line routing method in4],results in not rejecting the request in an irresponsible way.