QoS routing algorithms for pre-computed paths

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

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

    4 Citations (Scopus)

    Abstract

    Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSRBF algorithm), we have shown that, for a number of specific QoS constraints, it can be solved in polynomial time, when Weighted Fair Queueing (WFQ) service discipline is employed. QoSRBF is an on-demand algorithm. In this paper we propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also have shown that the size of routing table could be reduced, as paths satisfying some conditions could be neglected.

    Original languageEnglish
    Title of host publicationProceedings of the International Conference on Computer Communications and Networks, ICCCN
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Pages248-251
    Number of pages4
    Publication statusPublished - 1997
    EventProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
    Duration: 1997 Sep 221997 Sep 25

    Other

    OtherProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
    CityLas Vegas, NV, USA
    Period97/9/2297/9/25

    ASJC Scopus subject areas

    • Computer Science(all)

    Fingerprint Dive into the research topics of 'QoS routing algorithms for pre-computed paths'. Together they form a unique fingerprint.

  • Cite this

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1997). QoS routing algorithms for pre-computed paths. In Proceedings of the International Conference on Computer Communications and Networks, ICCCN (pp. 248-251). IEEE.