摘要
提出了一种用于MPLS网络流量工程中的动态在线路由算法NORA.该算法在网络拓扑结构基础上定义了链路关键度,根据链路的带宽利用率定义了链路繁忙度,利用链路关键度、链路当前可用带宽及链路繁忙度确定链路权重,并依据该权重运用最短路径优先算法思想为到达的LSP建立请求选择权重优化路径.该算法在动态建立有带宽保证路径的同时可以均衡网络负载,并降低LSP建立请求服务拒绝率.仿真实验表明,与SPF及MIRA算法相比,该算法在降低LSP建立请求服务拒绝率以及均衡网络负载等方面表现出更好的性能.
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.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2006年第9期976-978,共3页
Journal of Northeastern University(Natural Science)
基金
国家高技术研究发展计划项目(2002AA784030)
关键词
约束路由
流量工程
标记交换路径
链路关键度
链路繁忙度
constraint-based routing
traffic engineering
label switching path
link importance value
link busy degree
