一种MPLS流量工程中的动态路由算法

提出了一种MPLS流量工程中新的保证带宽的动态路由算法。传统的算法如SPF(Shortest Path First)算法、WSP算法（Widest Shortest Path）等都没有利用业务分布或入出路由器对（Ingress-Egress Pairs）的信息，可能导致严重的网络资源使用不充分的问题。该方法分两步：①离线路由，基于业务分布和日常统计的静态研究；该阶段能充分利用网络资源，有助于在线路由阶段动态路径的选择及避免拥塞；②根据第①步的结论及实际的网络状态，在线路由。重点针对在线路由提出了一种新的动

A Dynamic Routing Algorithm in MPLS Traffic Engineering

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.