中文摘要：

优化网络资源利用是Internet流量工程的重要目标之一.最小冲突路由机制通过利用多协议标记交换（MPLS）网络中的源-目的（SD）节点对信息,在为业务流请求选择标记交换路径（LSP）时,尽可能避免当前请求与将来请求之间的冲突,实现网络资源的合理利用.作者基于最小冲突机制,提出一种新颖的最小冲突路径算法（LIP）.LIP通过简单的最短路径算法定位关键链路,并将链路剩余容量、节点对之间的冲突和竞争结合起来定义链路权重,在实现网络资源高效利用的同时,降低了算法的计算复杂度.实验结果进一步验证,相对于以往算法,LIP在请求带宽拒绝率、网络带宽接收量和LSP平均路径长度等方面都比较理想.

英文摘要：

Optimizing network resource utilization is one of the important goals for Internet Traffic Engineering. To achieve this goal, Minimum Interference Routing schema is proposed in Multi-Protocol Label Switching network which uses the information regarding the source-destination （SD） pairs to reduce interference between current request and future requests for the establishment of Label Switched Paths （LSP）. Based on this schema, the authors propose a novel Least Interference Path （LIP） algorithm. First LIP identifies the critical links by Shortest Path First （SPF） algorithm simply. Then it assigns links weight associated with link residual capacity, interference, and competition on the link of all SD pairs. LIP achieves both high resource efficiency and low computation complexity. Simulation results demonstrate that LIP performs better than the existing algorithms in terms of bandwidth rejection ratio, total available flow of the network, and average length of LSPs.