IEICE TRANSACTIONS on Communications
Dynamic Multicast Routing Algorithm Using Predetermined Path Search
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.5 pp.1128-1135
- Publication Date
- 2000/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA, "Dynamic Multicast Routing Algorithm Using Predetermined Path Search" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 5, pp. 1128-1135, May 2000, doi: .
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_5_1128/_p
Copy
@ARTICLE{e83-b_5_1128,
author={Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Multicast Routing Algorithm Using Predetermined Path Search},
year={2000},
volume={E83-B},
number={5},
pages={1128-1135},
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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Dynamic Multicast Routing Algorithm Using Predetermined Path Search
T2 - IEICE TRANSACTIONS on Communications
SP - 1128
EP - 1135
AU - Takuya ASAKA
AU - Takumi MIYOSHI
AU - Yoshiaki TANAKA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2000
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.
ER -
English
