QoS routing algorithms for pre-computed paths

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    研究成果: Conference contribution

    4 被引用数 (Scopus)

    抄録

    Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSRBF algorithm), we have shown that, for a number of specific QoS constraints, it can be solved in polynomial time, when Weighted Fair Queueing (WFQ) service discipline is employed. QoSRBF is an on-demand algorithm. In this paper we propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also have shown that the size of routing table could be reduced, as paths satisfying some conditions could be neglected.

    本文言語English
    ホスト出版物のタイトルProceedings of the International Conference on Computer Communications and Networks, ICCCN
    Place of PublicationPiscataway, NJ, United States
    出版社IEEE
    ページ248-251
    ページ数4
    出版ステータスPublished - 1997
    イベントProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
    継続期間: 1997 9 221997 9 25

    Other

    OtherProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
    CityLas Vegas, NV, USA
    Period97/9/2297/9/25

    ASJC Scopus subject areas

    • Computer Science(all)

    フィンガープリント 「QoS routing algorithms for pre-computed paths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル