Performance evaluation of K shortest path algorithms in MPLS traffic engineering

被引:0
作者
Liu, G [1 ]
Yang, Y [1 ]
Lin, XK [1 ]
机构
[1] Tsinghua Univ, EE Dept, Beijing, Peoples R China
关键词
k shortest path algorithm; traffic engineering; performance evaluation;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A number of on-line and off-line algorithms for load balancing on multiple paths for MPLS (MultiProtocol Label Switching) traffic engineering have now been proposed, in which it is always assumed that sets of LSPs (Label Switched Path) have already been established between node pairs. While how to choose these paths is an important issue in traffic engineering, it has not been well studied yet. In this paper, we attempt to fill in this gap. As the shortest paths are always preferred in routing problems, we evaluate several k shortest path algorithms from the viewpoint of bandwidth use efficiency and the number of the found paths. Extensive simulations have been performed in different kinds of topologies to factor out effects of network characteristics on these algorithms' path calculation performances. It is found out that the performances of the evaluated algorithms are limited in some cases and the design of new algorithms for the path calculation problem is worth studying in the future.
引用
收藏
页码:1007 / 1011
页数:5
相关论文
共 15 条
[1]  
Bertsekas D. P., 1992, DATA NETWORKS
[2]  
Elwalid A, 2001, IEEE INFOCOM SER, P1300, DOI 10.1109/INFCOM.2001.916625
[3]   Finding the k shortest paths [J].
Eppstein, D .
SIAM JOURNAL ON COMPUTING, 1998, 28 (02) :652-673
[4]  
FARKAS K, 2001, P POL CZECH HUNG WOR, P1
[5]  
FORTZ B, 2000, INFOCOM2000 TEL AV I
[6]  
FOX BL, 1975, OPER RES, V23, pB263
[7]  
Hershberger J, 2003, SIAM PROC S, P26
[8]  
Hopps C, 2000, Analysis of an Equal-Cost Multi-Path Algorithm, DOI [DOI 10.17487/RFC2992, 10.17487/RFC2992]
[9]  
KHANNA A, 1989, COMP COMM R, V19, P45, DOI 10.1145/75247.75252
[10]   PROCEDURE FOR COMPUTING K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO SHORTEST PATH PROBLEM [J].
LAWLER, EL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07) :401-405