Dynamic multicast routing algorithm using predetermined path search

Takuya Asaka*, Takumi Miyosh, Yoshiaki Tanaka

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

研究成果: Article査読

3 被引用数 (Scopus)

抄録

With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

本文言語English
ページ(範囲)1128-1134
ページ数7
ジャーナルIEICE Transactions on Communications
E83-B
5
出版ステータスPublished - 2000 1月 1
外部発表はい

ASJC Scopus subject areas

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

フィンガープリント

「Dynamic multicast routing algorithm using predetermined path search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル