QoS based routing algorithm in integrated services packet networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

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

    46 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
    Title of host publicationInternational Conference on Network Protocols
    Place of PublicationLos Alamitos, CA, United States
    PublisherIEEE Comp Soc
    Pages167-174
    Number of pages8
    Publication statusPublished - 1997
    EventProceedings of the 1997 International Conference on Network Protocols - Atlanta, GA, USA
    Duration: 1997 Oct 281997 Oct 31

    Other

    OtherProceedings of the 1997 International Conference on Network Protocols
    CityAtlanta, GA, USA
    Period97/10/2897/10/31

    ASJC Scopus subject areas

    • Software

    Fingerprint Dive into the research topics of 'QoS based routing algorithm in integrated services packet networks'. Together they form a unique fingerprint.

  • Cite this

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1997). QoS based routing algorithm in integrated services packet networks. In International Conference on Network Protocols (pp. 167-174). IEEE Comp Soc.