The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
많은 노드가 위성망과 지상망 모두에 의해 상호 연결된 ST(위성-지상파) 네트워크는 멀티캐스트 서비스를 효율적으로 지원할 수 있습니다. 대규모 멀티캐스트 그룹에는 위성방송이 적합하고, 소규모 멀티캐스트 그룹에는 지상파 방송이 적합하기 때문이다. ST 네트워크에는 적절한 위성 및 지상 경로를 선택할 수 있는 멀티캐스트 라우팅 알고리즘이 필요합니다. 기존의 지상망 동적 라우팅 알고리즘은 노드 추가 시 기본적으로 비용이 저렴한 경로를 선택하기 때문에 효율적인 멀티캐스트 라우팅 트리를 구성할 수 없습니다. 우리는 그룹에 노드가 추가될 때 멀티캐스트 그룹 크기에 따라 사용할 경로를 선택하는 ST 네트워크용 가상 비용 기반 알고리즘인 동적 라우팅 알고리즘을 개발했습니다. 시뮬레이션 결과, 제안된 알고리즘은 정상상태 시뮬레이션 동안 멀티캐스트 그룹에 노드를 추가하거나 제거할 때 유리한 것으로 나타났다.
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.
부
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
부
@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},}
부
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 -