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 publicationIEEE International Workshop on Quality of Service, IWQoS
    DOIs
    Publication statusPublished - 2011
    Event2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 - San Jose, CA
    Duration: 2011 Jun 62011 Jun 7

    Other

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

    Fingerprint

    Routing algorithms
    Quality of service
    Polynomials
    Dynamic programming

    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 IEEE International Workshop on Quality of Service, IWQoS [5931329] https://doi.org/10.1109/IWQOS.2011.5931329

    QoS routing algorithms using fully polynomial time approximation scheme. / Huang, Jun; Tanaka, Yoshiaki.

    IEEE International Workshop on Quality of Service, IWQoS. 2011. 5931329.

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

    Huang, J & Tanaka, Y 2011, QoS routing algorithms using fully polynomial time approximation scheme. in IEEE International Workshop on Quality of Service, IWQoS., 5931329, 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011, San Jose, CA, 11/6/6. https://doi.org/10.1109/IWQOS.2011.5931329
    Huang J, Tanaka Y. QoS routing algorithms using fully polynomial time approximation scheme. In IEEE International Workshop on Quality of Service, IWQoS. 2011. 5931329 https://doi.org/10.1109/IWQOS.2011.5931329
    Huang, Jun ; Tanaka, Yoshiaki. / QoS routing algorithms using fully polynomial time approximation scheme. IEEE International Workshop on Quality of Service, IWQoS. 2011.
    @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",
    doi = "10.1109/IWQOS.2011.5931329",
    language = "English",
    isbn = "9781457701030",
    booktitle = "IEEE International Workshop on Quality of Service, IWQoS",

    }

    TY - GEN

    T1 - QoS routing algorithms using fully polynomial time approximation scheme

    AU - Huang, Jun

    AU - Tanaka, Yoshiaki

    PY - 2011

    Y1 - 2011

    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

    SN - 9781457701030

    BT - IEEE International Workshop on Quality of Service, IWQoS

    ER -