A dynamic multicast routing satisfying multiple QoS constraints

Debasish Chakraborty*, Goutam Chakraborty, Norio Shiratori

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

    研究成果査読

    22 被引用数 (Scopus)

    抄録

    In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.

    本文言語English
    ページ(範囲)321-335
    ページ数15
    ジャーナルInternational Journal of Network Management
    13
    5
    DOI
    出版ステータスPublished - 2003 9

    ASJC Scopus subject areas

    • ソフトウェア

    フィンガープリント

    「A dynamic multicast routing satisfying multiple QoS constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル