Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1128-1134 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Communications |
| Volume | E83-B |
| Issue number | 5 |
| Publication status | Published - 2000 Jan 1 |
Fingerprint
Keywords
- Algorithm
- Dynamic
- Multicast
- Routing
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
Asaka, T., Miyosh, T., & Tanaka, Y. (2000). Dynamic multicast routing algorithm using predetermined path search. IEICE Transactions on Communications, E83-B(5), 1128-1134.