Routing with QoS constraints in integrated services networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

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

    2 Citations (Scopus)

    Abstract

    Though the complexity for finding QoS guaranteed route in integrated services networks is proved to be NP-complete, the proof has been done without the assumption of any specific service discipline. Because each service discipline has different QoS bound computation expressions, we propose that QoS routing algorithm should be designed for specific service discipline used. We then present a proof that, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, by employing Weight Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Therefore we can search such a multiple QoS constrained route in polynomial time. We also present that routing algorithm (called `QoSRBF'), which is a modified version of Bellman-Ford. QoSRBF can, not only successfully find the route that can satisfy the required QoS constraints, but also utilize resources wisely to minimize the call blocking probability for future calls.

    Original languageEnglish
    Title of host publicationProceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet
    Editors Anon
    Place of PublicationLos Alamitos, CA, United States
    PublisherIEEE Comp Soc
    Pages152-161
    Number of pages10
    Publication statusPublished - 1997
    EventProceedings of the 1997 IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet - Santiago, Chile
    Duration: 1997 Nov 241997 Nov 27

    Other

    OtherProceedings of the 1997 IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet
    CitySantiago, Chile
    Period97/11/2497/11/27

    Fingerprint

    Quality of service
    Routing algorithms
    Blocking probability
    Jitter
    Polynomials
    Bandwidth

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1997). Routing with QoS constraints in integrated services networks. In Anon (Ed.), Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet (pp. 152-161). Los Alamitos, CA, United States: IEEE Comp Soc.

    Routing with QoS constraints in integrated services networks. / Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet. ed. / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1997. p. 152-161.

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

    Pornavalai, C, Chakraborty, G & Shiratori, N 1997, Routing with QoS constraints in integrated services networks. in Anon (ed.), Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet. IEEE Comp Soc, Los Alamitos, CA, United States, pp. 152-161, Proceedings of the 1997 IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet, Santiago, Chile, 97/11/24.
    Pornavalai C, Chakraborty G, Shiratori N. Routing with QoS constraints in integrated services networks. In Anon, editor, Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet. Los Alamitos, CA, United States: IEEE Comp Soc. 1997. p. 152-161
    Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / Routing with QoS constraints in integrated services networks. Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet. editor / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1997. pp. 152-161
    @inproceedings{f87c3cfe2c3845b687ad16f10ba05da4,
    title = "Routing with QoS constraints in integrated services networks",
    abstract = "Though the complexity for finding QoS guaranteed route in integrated services networks is proved to be NP-complete, the proof has been done without the assumption of any specific service discipline. Because each service discipline has different QoS bound computation expressions, we propose that QoS routing algorithm should be designed for specific service discipline used. We then present a proof that, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, by employing Weight Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Therefore we can search such a multiple QoS constrained route in polynomial time. We also present that routing algorithm (called `QoSRBF'), which is a modified version of Bellman-Ford. QoSRBF can, not only successfully find the route that can satisfy the required QoS constraints, but also utilize resources wisely to minimize the call blocking probability for future calls.",
    author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1997",
    language = "English",
    pages = "152--161",
    editor = "Anon",
    booktitle = "Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet",
    publisher = "IEEE Comp Soc",

    }

    TY - GEN

    T1 - Routing with QoS constraints in integrated services networks

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1997

    Y1 - 1997

    N2 - Though the complexity for finding QoS guaranteed route in integrated services networks is proved to be NP-complete, the proof has been done without the assumption of any specific service discipline. Because each service discipline has different QoS bound computation expressions, we propose that QoS routing algorithm should be designed for specific service discipline used. We then present a proof that, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, by employing Weight Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Therefore we can search such a multiple QoS constrained route in polynomial time. We also present that routing algorithm (called `QoSRBF'), which is a modified version of Bellman-Ford. QoSRBF can, not only successfully find the route that can satisfy the required QoS constraints, but also utilize resources wisely to minimize the call blocking probability for future calls.

    AB - Though the complexity for finding QoS guaranteed route in integrated services networks is proved to be NP-complete, the proof has been done without the assumption of any specific service discipline. Because each service discipline has different QoS bound computation expressions, we propose that QoS routing algorithm should be designed for specific service discipline used. We then present a proof that, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, by employing Weight Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Therefore we can search such a multiple QoS constrained route in polynomial time. We also present that routing algorithm (called `QoSRBF'), which is a modified version of Bellman-Ford. QoSRBF can, not only successfully find the route that can satisfy the required QoS constraints, but also utilize resources wisely to minimize the call blocking probability for future calls.

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

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

    M3 - Conference contribution

    SP - 152

    EP - 161

    BT - Proceedings of the IEEE Conference on Protocols for Multimedia Systems and Multimedia Networking, PROMS-MmNet

    A2 - Anon, null

    PB - IEEE Comp Soc

    CY - Los Alamitos, CA, United States

    ER -