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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kuipers, F.A., Korkmaz, T., Krunz, M., Mieghem, P.V.: An Overview of Constraint-Based Path Selection Algorithms for QoS Routing. IEEE Commun. Mag. 40(12), 50–55 (2002)
Yuan, X.: Heuristic Algorithms for Multiconstrained Quality-of-Service Routing. IEEE/ ACM Trans. Netw. 10, 244–256 (2002)
Xiao, W., Luo, Y., Soong, B.H., Xu, A., Law, C.L., Ling, K.V.: An Efficient Heuristic Algorithm for Multi-constrained Path Problems. In: IEEE VTC 2002, pp. 1317–1321 (Fall 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, W., Soong, B.H., Law, C.L., Guan, Y.L. (2004). Improved Limited Path Heuristic Algorithm for Multi-constrained QoS Routing. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)