IEICE TRANSACTIONS on Communications
Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks
Summary :
Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.3 pp.680-689
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Signaling System and Communication Protocol
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, "Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 3, pp. 680-689, March 2000, doi: .
Abstract: Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous 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_3_680/_p
Copy
@ARTICLE{e83-b_3_680,
author={Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks},
year={2000},
volume={E83-B},
number={3},
pages={680-689},
abstract={Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 680
EP - 689
AU - Takuya ASAKA
AU - Takumi MIYOSHI
AU - Yoshiaki TANAKA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2000
AB - Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.
ER -
English
