QoS based routing algorithm in integrated services packet networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    研究成果: Conference contribution

    46 被引用数 (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
    ホスト出版物のタイトルInternational Conference on Network Protocols
    Place of PublicationLos Alamitos, CA, United States
    出版社IEEE Comp Soc
    ページ167-174
    ページ数8
    出版ステータスPublished - 1997
    イベントProceedings of the 1997 International Conference on Network Protocols - Atlanta, GA, USA
    継続期間: 1997 10 281997 10 31

    Other

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

    ASJC Scopus subject areas

    • Software

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

    引用スタイル