An efficient QoS routing algorithm for multi-constrained path selection
Academic Article
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
An efficient QoS routing algorithm was proposed for multiple constrained path selection. 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 (r) of EAMCOP 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 H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.
