QoS based routing algorithm in Integrated Services Packet Networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    研究成果: Article

    9 引用 (Scopus)

    抜粋

    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.

    元の言語English
    ページ(範囲)99-112
    ページ数14
    ジャーナルJournal of High Speed Networks
    7
    発行部数2
    出版物ステータスPublished - 1998

      フィンガープリント

    ASJC Scopus subject areas

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

    これを引用

    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.