LSP Setup Arrival Reordering Approach for MPLS-TE Routing
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
复制标题
DOI：
10.1109/glocom.2007.87
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
I. Chaieb;J. L. Roux;Bernard A. Cousin
中科院分区：
文献类型：
--
作者：
I. Chaieb;J. L. Roux;Bernard A. Cousin
在本文中，我们评估的解决方案的基础上的抢占机制，以提高性能的分布式多协议标签交换流量工程（MPLS-TE）的路径计算，其中请求被处理一个接一个，在不协调的方式，没有任何知识的未来和其他请求。我们的解决方案的动机是相当大的影响隧道设置顺序对网络负载和阻塞概率。如果无法控制此顺序，则在某些情况下可以使用抢占功能对请求重新排序。在评估隧道设置顺序的影响后，我们研究了使用抢占重新排序LSP设置，使用各种算法，包括最短路径优先（SPF），最宽最短路径（WSP）和最短最宽路径（SWP）。我们表明，抢占是非常适合最短路径为基础的算法和阻塞率方面的性能显着改善。
In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed multi-protocol label switching-traffic engineering (MPLS-TE) path computation, where requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. Our solution is motivated by the considerable impact of the tunnel setup order on the network load and blocking probability. If it is not possible to control this order, in return it is possible, in some cases, to reorder requests using the pre-emption function. After evaluating the impact of the tunnel setup order, we study the use of preemption to reorder LSP setup, with various algorithms, including shortest path first (SPF), widest shortest path (WSP) and shortest widest path (SWP). We show that the preemption is well suited to shortest path based algorithms and the performances in terms of blocking rate are significantly improved.