一种新的MPLS流量工程最小干涉算法  

A New Least Interference Path Algorithm for MPLS Traffic Engineering

作　　者：许经彩[1] 王新华[1] 薛健[2] 苑芳兵[1] 

机构地区：[1]山东师范大学信息科学与工程学院,山东济南250014 [2]济南大学,山东济南250022

出　　处：《计算机技术与发展》2009年第10期77-80,共4页Computer Technology and Development

基　　金：山东省自然科学基金项目(Y2006G19)

摘　　要：优化网络资源利用是Internet流量工程的重要目标之一。MIRA等著名算法通过绕开关键链路而最小化不同源-目的节点对之间的干涉,但是,有些情况下,这些算法可能导致选择过长的路径,或在寻找关键路径时判断不准确,并且关键路径的计算非常复杂,路由建立的时间较长。针对MPLS流量工程路由算法存在的不足,提出了一种新的用于MPLS网络流量工程的路由算法MICA-K,该算法综合考虑了链路带宽平均利用率、冲突度和竞争度三个网络参数,在K最短路径中选择一条最小化资源占用和负载平衡的路径。本算法在提高网络资源利用率的同时,降低了算法的计算复杂度。模拟结果证明算法在网络吞吐量和负载均衡方面达到了更好的性能。Optimizing network resource utilization is one of the important goals for Internet traffic engineering. The prior famous MPLS routing algorithms such as MIRA try to minimize the interference between different source- destination pairs by circumventing the critical links. But it may choose a very long path, and the identification of critical links is not very accurate in some circumstances. Furthermore, because the computation for critical links is very complex, the time for route setup is very long. In this paper,research work on challenges of current routing algorithms for MPLS traffic engineering is investigated, and an improved routing approach named MICA - K is proposed, which is characterized by taking average occupancy rate, interference and competition into consideration. This approach acquires K shortest paths using K shortest path algorithm firstly and then chooses the path which minimizes the occupied resources and balances the load. MICA- K achieves both high resource efficiency and low computation complexity. Simulation results show that our proposed algorithm performs better than the existing famous algorithms in the literature.

关 键 词：多协议标签交换 MICA-K 冲突度 竞争度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]