An efficient QoS routing algorithm for multi-constrained path selection

来源期刊：中南大学学报(英文版)2003年第2期

论文作者：王建新 彭革刚 陈松乔 陈建二

文章页码：151 - 154

Key words：QoS routing; multiple constraint; path selection; algorithm

Abstract: An efficient QoS routing algorithm was proposed for multiple constrained pathselection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio (r) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time (t) of EAM- COP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of HMCOP in Advanced Research Projects Agency Network (ARPANet) topology.