The primal simplex approach to the QoS routing problem

Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue

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

3 Scopus citations

Abstract

Quality-of-Service (QoS) routing problem requires the determination of a minimum cost path from a source node s to a destination node t in a data network such that the delay of the path is bounded by Δ (> 0). This problem also known as the constrained shortest path (CSP) problem is NP-hard. So, heuristics and approximation algorithms have been presented in the literature. Among the heuristics, the LARAC algorithm, based on the dual of the LP relaxation or the Lagrangian relaxation of the CSP problem is very efficient. In this paper we study the primal simplex approach to the LP relaxation of the CSP problem and present an approximation algorithm to this problem. Several issues relating to efficient implementations of our approach are discussed. Experimental results comparing the performance of the new algorithm with that of the LARAC algorithm are presented.

Original languageEnglish (US)
Title of host publicationProceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004
EditorsA. Boukerche, J. Cobb, S. Chen, M.Y. Fang
Pages120-129
Number of pages10
StatePublished - Dec 1 2004
EventProceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004 - Dallas, TX, United States
Duration: Oct 18 2004Oct 20 2004

Publication series

NameProceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004

Other

OtherProceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004
CountryUnited States
CityDallas, TX
Period10/18/0410/20/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'The primal simplex approach to the QoS routing problem'. Together they form a unique fingerprint.

  • Cite this

    Xiao, Y., Thulasiraman, K., & Xue, G. (2004). The primal simplex approach to the QoS routing problem. In A. Boukerche, J. Cobb, S. Chen, & M. Y. Fang (Eds.), Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004 (pp. 120-129). (Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004).