Label algorithm for delay-constrained dynamic multicast routing

Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

研究成果査読

1 被引用数 (Scopus)

抄録

Many new multimedia applications involve multiple dynamically changing 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 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 were added to or removed from the multicast group during a steady-state simulation.

本文言語English
ページ(範囲)55-62
ページ数8
ジャーナルIEICE Transactions on Communications
E84-B
1
出版ステータスPublished - 2001 1
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「Label algorithm for delay-constrained dynamic multicast routing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル