QoS based routing algorithm in Integrated Services Packet Networks

Chotipat Pornavalai, Goutam Chakraborty*, Norio Shiratori

*この研究の対応する著者

    研究成果: Article査読

    10 被引用数 (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

    • コンピュータ ネットワークおよび通信
    • ハードウェアとアーキテクチャ
    • 情報システム
    • 電子工学および電気工学

    フィンガープリント

    「QoS based routing algorithm in Integrated Services Packet Networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル