Evaluation of heuristic path selection algorithms for multi-constrained QoS routing

Conference Proceeding - IEEE International Conference on Networking, Sensing and Control

Volumn 1, Issue , 2004, Pages 112-116

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

ILPHA; LPDA; LPHA; Non linear path function; QoS routing; TAMCRA

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JITTER; ROUTERS;

ILPHA; LPDA; LPHA; NON-LINEAR PATH FUNCTION; QOS ROUTING; TAMCRA;

QUALITY OF SERVICE;

EID: 2942642110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. S. Chen and K. Nahrstedt, "On finding multi-constrained paths", in Proc. IEEE Int. Conf. Communications (ICC"98), Atlanta, USA, Vol. 2, pp. 874-879, June 1998.
2. J. M. Jaffe, "Algorithms for finding paths with multiple constraints", Networks, Vol. 14, pp. 95-116, Spring 1984.
3. F.A. Kuipers, T. Korkmaz, M. Krunz and P. Van Mieghem, "An overview of constraint-based path selection algorithms for QoS routing", IEEE Communications Magazine, Vol. 40, No. 12, pp. 50-55, December 2002.
4. H. De Neve and P. Van Mieghem, "TAMCRA: a tunable accuracy multiple constraints routing algorithm", Comp. Commun., Vol. 23, pp. 667-79, 2000.
5. Z. Wang and J. Crowcroft, "QoS routing for supporting resource reservation", IEEE J. Select. Areas Commun., Vol. 14, pp. 1228-1234, Septmber 1996.
6. W. Xiao, Y. Luo, B. H. Soong, et al. "An efficient heuristic algorithm for multi-constrained path problems", in Proc. of VTC2002-Fall, Vancouver, British Columbia, Canada, September 2002.
7. W. Xiao, B. H. Soong, C. L. Law, Y. L. Guan, K. V. Ling, "Improved limited path heuristic algorithm for QoS routing", ICC 2004, submitted.
8. X. Yuan, "Heuristic algorithms for multiconstrained quality-of-service routing", IEEE/ACM Transactions on Networking, vol. 10, pp. 244-256, April 2002.