Improved limited path heuristic algorithm for multi-constrained qos routing

  • Authors:
  • Wendong Xiao;Boon Hee Soong;Choi Look Law;Yong Liang Guan

  • Affiliations:
  • Institute for Infocomm Research, New Initiatives, Singapore;Positioning and Wireless Technology Centre, Nanyang Technological University, Singapore;Positioning and Wireless Technology Centre, Nanyang Technological University, Singapore;Positioning and Wireless Technology Centre, Nanyang Technological University, Singapore

  • Venue:
  • PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.