A new routing algorithm for delay-constrained dynamic multicast

T. Asaka, T. Miyoshi, Yoshiaki Tanaka

    研究成果: Conference contribution

    抜粋

    Many new multimedia applications involve dynamic multiple participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows "two coming paths", where nodes in a multicast tree transmit the several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of "two coming paths", and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes are added to or removed from the multicast group during a steady-state simulation.

    元の言語English
    ホスト出版物のタイトル1st European Conference on Universal Multiservice Networks, ECUMN 2000
    出版者Institute of Electrical and Electronics Engineers Inc.
    ページ231-238
    ページ数8
    ISBN(電子版)0780364198, 9780780364196
    DOI
    出版物ステータスPublished - 2000
    イベント1st European Conference on Universal Multiservice Networks, ECUMN 2000 - Colmar, France
    継続期間: 2000 10 22000 10 4

    Other

    Other1st European Conference on Universal Multiservice Networks, ECUMN 2000
    France
    Colmar
    期間00/10/200/10/4

    ASJC Scopus subject areas

    • Computer Networks and Communications

    フィンガープリント A new routing algorithm for delay-constrained dynamic multicast' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Asaka, T., Miyoshi, T., & Tanaka, Y. (2000). A new routing algorithm for delay-constrained dynamic multicast. : 1st European Conference on Universal Multiservice Networks, ECUMN 2000 (pp. 231-238). [880746] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ECUMN.2000.880746