QoS based routing algorithm in Integrated Services Packet Networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    Research output: Contribution to journalArticle

    9 Citations (Scopus)

    Abstract

    In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss-free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.

    Original languageEnglish
    Pages (from-to)99-112
    Number of pages14
    JournalJournal of High Speed Networks
    Volume7
    Issue number2
    Publication statusPublished - 1998

    Fingerprint

    Packet networks
    Routing algorithms
    Quality of service
    Jitter
    Polynomials
    Bandwidth

    Keywords

    • Integrated Services Packet Networks
    • QoS constraints
    • Resource reservation
    • Routing algorithm

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Hardware and Architecture
    • Information Systems
    • Electrical and Electronic Engineering

    Cite this

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1998). QoS based routing algorithm in Integrated Services Packet Networks. Journal of High Speed Networks, 7(2), 99-112.

    QoS based routing algorithm in Integrated Services Packet Networks. / Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    In: Journal of High Speed Networks, Vol. 7, No. 2, 1998, p. 99-112.

    Research output: Contribution to journalArticle

    Pornavalai, C, Chakraborty, G & Shiratori, N 1998, 'QoS based routing algorithm in Integrated Services Packet Networks', Journal of High Speed Networks, vol. 7, no. 2, pp. 99-112.
    Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / QoS based routing algorithm in Integrated Services Packet Networks. In: Journal of High Speed Networks. 1998 ; Vol. 7, No. 2. pp. 99-112.
    @article{d3d051897db5480293f25406ebb6f19d,
    title = "QoS based routing algorithm in Integrated Services Packet Networks",
    abstract = "In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss-free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.",
    keywords = "Integrated Services Packet Networks, QoS constraints, Resource reservation, Routing algorithm",
    author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1998",
    language = "English",
    volume = "7",
    pages = "99--112",
    journal = "Journal of High Speed Networks",
    issn = "0926-6801",
    publisher = "IOS Press",
    number = "2",

    }

    TY - JOUR

    T1 - QoS based routing algorithm in Integrated Services Packet Networks

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1998

    Y1 - 1998

    N2 - In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss-free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.

    AB - In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss-free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.

    KW - Integrated Services Packet Networks

    KW - QoS constraints

    KW - Resource reservation

    KW - Routing algorithm

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

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

    M3 - Article

    AN - SCOPUS:0002090401

    VL - 7

    SP - 99

    EP - 112

    JO - Journal of High Speed Networks

    JF - Journal of High Speed Networks

    SN - 0926-6801

    IS - 2

    ER -