Quality of service routing: Heuristics and approximation schemes with a comparative evaluation

Ravi Ravindran, K. Thulasiraman, Anindya Das, Kaiyuan Huang, Gang Luo, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this paper we consider a class of quality of service routing problems that can be formulated as the bounded delay minimum cost path problem. This is an NP-hard problem [2]. So heuristic approaches have been presented in the literature. In a recent work [11] we extensively evaluated the performance of a heuristic called the LHWHM algorithm originally presented in [7]. We have found the LHWHM algorithm (which is based on Dijkstra's minimum cost path algorithm) to be very effective for implementation in a real network environment. In this paper we present a new heuristic which is based on the Bellman-Ford-Moore algorithm for the min-cost path problem. Unlike the LHWHM algorithm this algorithm is also suitable for distributed implementations. We discuss several issues pertaining to an efficient implementation of this algorithm and compare its features with the LHWHM [7] algorithm. We prove that this heuristic produces a feasible path satisfying the delay constraint whenever such a path exists. We conclude with an experimental evaluation of the new heuristic in comparison with the LHWHM algorithm, a recent Lagrangian-Relaxation based heuristic [9] and the approximation algorithm due to Hassin [10] by running them on a large number of graphs. We believe that the LHWHM algorithm and our new BFM based heuristic are serious candidates for implementation in real network environments.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Volume3
StatePublished - 2002
Event2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States
Duration: May 26 2002May 29 2002

Other

Other2002 IEEE International Symposium on Circuits and Systems
CountryUnited States
CityPhoenix, AZ
Period5/26/025/29/02

Fingerprint

Quality of service
Costs
Approximation algorithms
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Ravindran, R., Thulasiraman, K., Das, A., Huang, K., Luo, G., & Xue, G. (2002). Quality of service routing: Heuristics and approximation schemes with a comparative evaluation. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 3)

Quality of service routing : Heuristics and approximation schemes with a comparative evaluation. / Ravindran, Ravi; Thulasiraman, K.; Das, Anindya; Huang, Kaiyuan; Luo, Gang; Xue, Guoliang.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3 2002.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ravindran, R, Thulasiraman, K, Das, A, Huang, K, Luo, G & Xue, G 2002, Quality of service routing: Heuristics and approximation schemes with a comparative evaluation. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 3, 2002 IEEE International Symposium on Circuits and Systems, Phoenix, AZ, United States, 5/26/02.
Ravindran R, Thulasiraman K, Das A, Huang K, Luo G, Xue G. Quality of service routing: Heuristics and approximation schemes with a comparative evaluation. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3. 2002
Ravindran, Ravi ; Thulasiraman, K. ; Das, Anindya ; Huang, Kaiyuan ; Luo, Gang ; Xue, Guoliang. / Quality of service routing : Heuristics and approximation schemes with a comparative evaluation. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3 2002.
@inproceedings{5929442f828945099ee9372ef4ca6546,
title = "Quality of service routing: Heuristics and approximation schemes with a comparative evaluation",
abstract = "In this paper we consider a class of quality of service routing problems that can be formulated as the bounded delay minimum cost path problem. This is an NP-hard problem [2]. So heuristic approaches have been presented in the literature. In a recent work [11] we extensively evaluated the performance of a heuristic called the LHWHM algorithm originally presented in [7]. We have found the LHWHM algorithm (which is based on Dijkstra's minimum cost path algorithm) to be very effective for implementation in a real network environment. In this paper we present a new heuristic which is based on the Bellman-Ford-Moore algorithm for the min-cost path problem. Unlike the LHWHM algorithm this algorithm is also suitable for distributed implementations. We discuss several issues pertaining to an efficient implementation of this algorithm and compare its features with the LHWHM [7] algorithm. We prove that this heuristic produces a feasible path satisfying the delay constraint whenever such a path exists. We conclude with an experimental evaluation of the new heuristic in comparison with the LHWHM algorithm, a recent Lagrangian-Relaxation based heuristic [9] and the approximation algorithm due to Hassin [10] by running them on a large number of graphs. We believe that the LHWHM algorithm and our new BFM based heuristic are serious candidates for implementation in real network environments.",
author = "Ravi Ravindran and K. Thulasiraman and Anindya Das and Kaiyuan Huang and Gang Luo and Guoliang Xue",
year = "2002",
language = "English (US)",
volume = "3",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

}

TY - GEN

T1 - Quality of service routing

T2 - Heuristics and approximation schemes with a comparative evaluation

AU - Ravindran, Ravi

AU - Thulasiraman, K.

AU - Das, Anindya

AU - Huang, Kaiyuan

AU - Luo, Gang

AU - Xue, Guoliang

PY - 2002

Y1 - 2002

N2 - In this paper we consider a class of quality of service routing problems that can be formulated as the bounded delay minimum cost path problem. This is an NP-hard problem [2]. So heuristic approaches have been presented in the literature. In a recent work [11] we extensively evaluated the performance of a heuristic called the LHWHM algorithm originally presented in [7]. We have found the LHWHM algorithm (which is based on Dijkstra's minimum cost path algorithm) to be very effective for implementation in a real network environment. In this paper we present a new heuristic which is based on the Bellman-Ford-Moore algorithm for the min-cost path problem. Unlike the LHWHM algorithm this algorithm is also suitable for distributed implementations. We discuss several issues pertaining to an efficient implementation of this algorithm and compare its features with the LHWHM [7] algorithm. We prove that this heuristic produces a feasible path satisfying the delay constraint whenever such a path exists. We conclude with an experimental evaluation of the new heuristic in comparison with the LHWHM algorithm, a recent Lagrangian-Relaxation based heuristic [9] and the approximation algorithm due to Hassin [10] by running them on a large number of graphs. We believe that the LHWHM algorithm and our new BFM based heuristic are serious candidates for implementation in real network environments.

AB - In this paper we consider a class of quality of service routing problems that can be formulated as the bounded delay minimum cost path problem. This is an NP-hard problem [2]. So heuristic approaches have been presented in the literature. In a recent work [11] we extensively evaluated the performance of a heuristic called the LHWHM algorithm originally presented in [7]. We have found the LHWHM algorithm (which is based on Dijkstra's minimum cost path algorithm) to be very effective for implementation in a real network environment. In this paper we present a new heuristic which is based on the Bellman-Ford-Moore algorithm for the min-cost path problem. Unlike the LHWHM algorithm this algorithm is also suitable for distributed implementations. We discuss several issues pertaining to an efficient implementation of this algorithm and compare its features with the LHWHM [7] algorithm. We prove that this heuristic produces a feasible path satisfying the delay constraint whenever such a path exists. We conclude with an experimental evaluation of the new heuristic in comparison with the LHWHM algorithm, a recent Lagrangian-Relaxation based heuristic [9] and the approximation algorithm due to Hassin [10] by running them on a large number of graphs. We believe that the LHWHM algorithm and our new BFM based heuristic are serious candidates for implementation in real network environments.

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

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

M3 - Conference contribution

AN - SCOPUS:0036287447

VL - 3

BT - Proceedings - IEEE International Symposium on Circuits and Systems

ER -