Abstract
Recently limited path heuristic algorithm (LPHA) was proposed for Quality of Service (QoS) Routing with multiple constraints based on the extended Bellman-Ford algorithm. In this paper, an improved limited path heuristic algorithm (ILPHA) is introduced by means of two novel strategies, i.e., combining checking to deal with the path loss problem, and path selection to choose high-quality paths. Two path selection heuristics are recommended respectively based on the dominating area and maximal weight. Simulation results show that ILPHA can improve the performance of LPHA significantly. The comparison between the two path selection heuristics is also given.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call