Improved limited path heuristic algorithm for multi-constrained QoS routing

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

doi:10.1007/978-3-540-30501-9_37

Improved limited path heuristic algorithm for multi-constrained QoS routing

Wendong Xiao^*, Boon Hee Soong, Choi Look Law, Yong Liang Guan

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English
Pages (from-to)	164-167
Number of pages	4
Journal	Lecture Notes in Computer Science
Volume	3320
DOIs	https://doi.org/10.1007/978-3-540-30501-9_37
Publication status	Published - 2004
Externally published	Yes
Event	5th International Conference, PDCAT 2004 - , Singapore Duration: Dec 8 2004 → Dec 10 2004

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-30501-9_37

Cite this

@article{9030cd3edc644fdf97af21960d7bbd4f,

title = "Improved limited path heuristic algorithm for multi-constrained QoS routing",

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.",

author = "Wendong Xiao and Soong, \{Boon Hee\} and Law, \{Choi Look\} and Guan, \{Yong Liang\}",

year = "2004",

doi = "10.1007/978-3-540-30501-9\_37",

language = "English",

volume = "3320",

pages = "164--167",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "5th International Conference, PDCAT 2004 ; Conference date: 08-12-2004 Through 10-12-2004",

}

TY - JOUR

T1 - Improved limited path heuristic algorithm for multi-constrained QoS routing

AU - Xiao, Wendong

AU - Soong, Boon Hee

AU - Law, Choi Look

AU - Guan, Yong Liang

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=13944277726&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13944277726&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30501-9_37

DO - 10.1007/978-3-540-30501-9_37

M3 - Conference article

AN - SCOPUS:13944277726

SN - 0302-9743

VL - 3320

SP - 164

EP - 167

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 5th International Conference, PDCAT 2004

Y2 - 8 December 2004 through 10 December 2004

ER -

Improved limited path heuristic algorithm for multi-constrained QoS routing

Abstract

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this