一种新的MPLS流量工程路由算法MSMR

MSMR:A New Traffic Engineering Routing Algorithm for MPLS Networks

本文提出了一种新的用于多协议标签交换网络流量工程的动态路由算法。先前研究者们提出的MIRA等著名算法试图通过绕开关键链路而最小化不同源-目的节点对之间的干涉。但是,有些情况下,这些算法可能选择过长的路径,或在寻找关键路径时判断不准确。因而本文提出了一种新的最大化其它入出口对之间的最大流之和的启发式算法。模拟结果证明了算法在拒绝率和吞吐量方面达到了更好的性能。

This paper presents a new dynamic online routing algorithm for the Multi-Protocol Label Switching （MFLS） 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. The main contribution of this paper is a new heuristic routing approach which maximizes the sum of the maximum flow value of all the other S-D pairs. Simulation results show that ourproposed algorithm performs better than the existing famous algorithms in the literature.