QoS routing algorithms using fully polynomial time approximation scheme

Jun Huang, Yoshiaki Tanaka

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

9 Citations (Scopus)

Abstract

Routing with end-to-end Quality-of-Service (QoS) guarantees is a key to the widespread deployment of recent emerged services. Developing QoS routing algorithm in the network is an important open topic. This paper investigates the QoS routing related problems and proposes a Fully Polynomial Time Approximation Scheme (FPTAS) for QoS routing. In the proposed FPTAS, a graph-extending based dynamic programming approach is developed, and an extended version of the proposed algorithm is studied. The theoretical analyses show that the proposed algorithms outperform the previous best-known studies.

Original languageEnglish
Title of host publication2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
DOIs
Publication statusPublished - 2011 Jul 28
Event2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 - San Jose, CA, United States
Duration: 2011 Jun 62011 Jun 7

Publication series

NameIEEE International Workshop on Quality of Service, IWQoS
ISSN (Print)1548-615X

Conference

Conference2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
CountryUnited States
CitySan Jose, CA
Period11/6/611/6/7

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Huang, J., & Tanaka, Y. (2011). QoS routing algorithms using fully polynomial time approximation scheme. In 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 [5931329] (IEEE International Workshop on Quality of Service, IWQoS). https://doi.org/10.1109/IWQOS.2011.5931329