QoS routing algorithms using fully polynomial time approximation scheme

Jun Huang; Yoshiaki Tanaka

doi:10.1109/IWQOS.2011.5931329

QoS routing algorithms using fully polynomial time approximation scheme

Jun Huang^*, Yoshiaki Tanaka

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 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 language	English
Title of host publication	2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
DOIs	https://doi.org/10.1109/IWQOS.2011.5931329
Publication status	Published - 2011 Jul 28
Event	2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 - San Jose, CA, United States Duration: 2011 Jun 6 → 2011 Jun 7

Publication series

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

Conference

Conference	2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
Country/Territory	United States
City	San Jose, CA
Period	11/6/6 → 11/6/7

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/IWQOS.2011.5931329

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, 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011, San Jose, CA, United States, 11/6/6. https://doi.org/10.1109/IWQOS.2011.5931329

@inproceedings{751d33b9c72949ae82430f1efa77aff9,

title = "QoS routing algorithms using fully polynomial time approximation scheme",

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

author = "Jun Huang and Yoshiaki Tanaka",

year = "2011",

month = jul,

day = "28",

doi = "10.1109/IWQOS.2011.5931329",

language = "English",

isbn = "9781457701030",

series = "IEEE International Workshop on Quality of Service, IWQoS",

booktitle = "2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011",

note = "2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 ; Conference date: 06-06-2011 Through 07-06-2011",

}

TY - GEN

T1 - QoS routing algorithms using fully polynomial time approximation scheme

AU - Huang, Jun

AU - Tanaka, Yoshiaki

PY - 2011/7/28

Y1 - 2011/7/28

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

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

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

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

U2 - 10.1109/IWQOS.2011.5931329

DO - 10.1109/IWQOS.2011.5931329

M3 - Conference contribution

AN - SCOPUS:79960657819

SN - 9781457701030

T3 - IEEE International Workshop on Quality of Service, IWQoS

BT - 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011

T2 - 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011

Y2 - 6 June 2011 through 7 June 2011

ER -

QoS routing algorithms using fully polynomial time approximation scheme

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this