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 |
| Externally published | Yes |
Fingerprint
Keywords
- Algorithm
- Dynamic
- Multicast
- Routing
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
Cite this
Dynamic multicast routing algorithm using predetermined path search. / Asaka, Takuya; Miyosh, Takumi; Tanaka, Yoshiaki.
In: IEICE Transactions on Communications, Vol. E83-B, No. 5, 2000, p. 1128-1134.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Dynamic multicast routing algorithm using predetermined path search
AU - Asaka, Takuya
AU - Miyosh, Takumi
AU - Tanaka, Yoshiaki
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
KW - Algorithm
KW - Dynamic
KW - Multicast
KW - Routing
UR - http://www.scopus.com/inward/record.url?scp=0034187818&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034187818&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0034187818
VL - E83-B
SP - 1128
EP - 1134
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
SN - 0916-8516
IS - 5
ER -