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.
|ジャーナル||IEICE Transactions on Communications|
|出版ステータス||Published - 2000|
ASJC Scopus subject areas
- コンピュータ ネットワークおよび通信