抜粋
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 |
| 外部発表 | Yes |
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
フィンガープリント Dynamic multicast routing algorithm using predetermined path search' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。
これを引用
Asaka, T., Miyosh, T., & Tanaka, Y. (2000). Dynamic multicast routing algorithm using predetermined path search. IEICE Transactions on Communications, E83-B(5), 1128-1134.